Search results

• File:Back-End.pdf ...ator pentru a putea rula programele reprezentate prin AST (abstract syntax tree). (297 KB) - 00:16, 22 December 2006

• 99 questions/Solutions/60
  Consider a height-balanced binary tree of height H. What is the maximum number of nodes it can contain? ...hask> that returns the minimum number of nodes in a height-balanced binary tree of height H.
  3 KB (407 words) - 13:38, 25 December 2016
• 99 questions/70B to 73
  ...y empty) set of successors which are multiway trees themselves. A multiway tree is never empty. The set of successor trees is sometimes called a forest. ...ottom:1px solid #eee">(*) Check whether a given term represents a multiway tree. <span style="float:right"><small>(no solution needed)</small></span>
  5 KB (876 words) - 05:50, 11 June 2023
• Git
  There are 4 kinds of objects: tag, blob, tree and commit. - a tree contains name associated by reference with blobs or trees. This represents
  3 KB (516 words) - 06:26, 3 April 2013
• User:PaoloMartini
  == Catamorfism on a binary tree == data Tree a = Leaf a
  7 KB (1,245 words) - 20:07, 4 February 2007
• Benchmarks Game/Parallel/BinaryTreesDPH
  stretch tree of depth 21 check: -1 long lived tree of depth 20 check: -1
  8 KB (1,082 words) - 22:27, 22 January 2012

• File:The Expression problem Solved untill 2008.png ...ou may see the various modules defining parts of the datatype which is the tree of the expresions. (642 × 325 (98 KB)) - 08:02, 3 June 2009

• Factory function
  ...ructure with invariants that you need to preserve, such as a binary search tree which needs to stay balanced. ...e declaration for a [http://en.wikipedia.org/wiki/Red-black_tree Red-Black tree] is:
  2 KB (456 words) - 20:29, 5 December 2008
• 99 questions/Solutions/67A
  ...ich does this inverse; i.e. given the string representation, construct the tree in the usual form. Finally, combine the two predicates in a single predicat treeToString :: Tree Char -> String
  2 KB (372 words) - 03:43, 10 January 2017
• Chaitin's construction/Parser
  ==== Binary tree ==== module Tree (Tree (Leaf, Branch)) where
  4 KB (583 words) - 14:31, 4 August 2006
• 99 questions/Solutions/66
  ...tight can you pack together two subtrees to construct the combined binary tree? layout :: Tree a -> Tree (a, Pos)
  4 KB (637 words) - 03:42, 10 January 2017
• 99 questions/Solutions/55
  In a completely balanced binary tree, the following property holds for every node: The number of nodes in its le ...via backtracking. Put the letter 'x' as information into all nodes of the tree.
  4 KB (694 words) - 01:23, 7 June 2021
• 99 questions/Solutions/63
  Construct a complete binary tree A complete binary tree with height H is defined as follows:
  9 KB (727 words) - 03:41, 10 January 2017

• File:Tipuri recursive.pdf ...pentru a implementa arborii sintaxei abstracte (eng: AST - abstract syntax tree). (169 KB) - 00:03, 22 December 2006

• Burton-style nondeterminism
  For the structured values, Burton defines a tree type: data Tree a = Node { contents :: a,
  2 KB (341 words) - 09:18, 22 February 2022
• 型
  他の例として、二分木 (binary [[Tree]])を考えてみましょう。このように表されます。 data Tree a = Branch (Tree a) (Tree a) | Leaf a
  8 KB (433 words) - 14:11, 7 December 2009
• 99 questions/Solutions/59
  In a height-balanced binary tree, the following property holds for every node: The height of its left subtre hbaltree :: a -> Int -> [Tree a]
  1 KB (215 words) - 13:38, 25 December 2016
• 99 questions/Solutions/65
  layout :: Tree a -> Tree (a, Pos) depth :: Tree a -> Int
  2 KB (299 words) - 03:42, 10 January 2017
• Constructor
  An example of a ''unary'' type constructor <haskell>Tree</haskell> data Tree a = Tip | Node a (Tree a) (Tree a)
  6 KB (1,060 words) - 16:51, 18 June 2021
• Hexpat/
  import Text.XML.Expat.Tree -- Note: Because we're not using the tree, Haskell can't infer the type of
  4 KB (552 words) - 09:01, 20 February 2010

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)