Search results

• 99 questions/Solutions/62
  Collect the internal nodes of a binary tree in a list An internal node of a binary tree has either one or two non-empty successors. Write a predicate internals/2 t
  717 bytes (98 words) - 13:39, 25 December 2016
• 99 questions/Solutions/69
  ...y subtree (nil) is encountered during the tree traversal. For example, the tree shown in problem P67 is represented as 'abd..e..c.fg...'. First, try to est data Tree a = Empty | Branch a (Tree a) (Tree a) deriving (Show, Eq)
  3 KB (285 words) - 03:44, 10 January 2017

• File:Tree-like folding.gif Tree-like folding in composites production. (733 × 433 (5 KB)) - 14:00, 14 February 2013

• File:WxGeneric MyTree.png WxGeneric example showing a tree structure (810 × 604 (31 KB)) - 12:46, 8 May 2009

• 99 questions/Solutions/56
  ...is symmetric. Hint: Write a predicate mirror/2 first to check whether one tree is the mirror image of another. We are only interested in the structure, no ...nsider the cases where two immediate branches may not be the same, but the tree as a whole could be symmetric. Hence a mirror function is more encompassing
  1 KB (179 words) - 13:36, 25 December 2016
• Algebraic data type
  ==Tree examples== Suppose we want to represent the following tree:
  3 KB (436 words) - 08:47, 22 May 2023
• Abstract syntax tree
  [http://en.wikipedia.org/wiki/Abstract_syntax_tree Abstract syntax tree] at wikipedia.
  107 bytes (15 words) - 15:17, 6 February 2021

• File:Tree-12-34.png Image for the ((1 2) (3 4)) tree (111 × 104 (2 KB)) - 11:28, 11 July 2007

• Enter the Lambda
  -- returns a tree to a function that returns the sum of the numbered -- tree (see the Examples section for numberTree and sumTree) you may
  2 KB (379 words) - 03:00, 1 May 2009
• 99 questions/Solutions/57
  ...chapter 4 of the course, to write a predicate to construct a binary search tree from a list of integer numbers. add :: Ord a => a -> Tree a -> Tree a
  741 bytes (117 words) - 22:03, 23 April 2021

• File:Logtree.png An example log tree visualization graph. This one depicts a FFT. (1,643 × 419 (151 KB)) - 23:33, 30 December 2013

• Gtk2Hs/Tutorials/TreeView
  tree <- Model.treeViewGetSelection treeview Model.treeSelectionSetMode tree SelectionSingle
  2 KB (280 words) - 00:46, 9 April 2021
• Zipper monad/TravelBTree
  ...y a subtree, said subtrees position within the entire tree, and the entire tree itself. See [[Zipper]] for an explanation of such concepts. insertLeft, -- insert a tree to the left of the current node
  3 KB (559 words) - 03:51, 8 October 2006
• 99 questions/Solutions/64
  ...the usual Prolog term t(X,L,R) (or nil). As a preparation for drawing the tree, a layout algorithm is required to determine the position of each node in a * y(v) is equal to the depth of the node v in the tree
  2 KB (337 words) - 03:41, 10 January 2017
• Gentoo/HaskellPlatform
  ...e overlay includes additional haskell packages that are not in the portage tree. ...that packages can not be marked stable until they have been in the portage tree for > 30 days. Some of the ebuilds are not stable yet, so they need to be
  2 KB (305 words) - 13:16, 3 June 2012

• File:Circum-op12cl-34.png Tree ((1 2) (3 4)) with left subtree marked. (153 × 125 (3 KB)) - 08:55, 19 July 2007

• Yhc/API/Compiler
  -- bracketLex - first step, as the compiler does it - a bracketLex tree, possibly with comments/spaces You want to parse the code to the parse tree, modify it in some way, then write it out again. How?
  3 KB (585 words) - 02:39, 15 January 2006

• File:Path-1X-34.png A path-like, more deconstructed representation of the context of a tree zipper. (119 × 111 (2 KB)) - 12:56, 15 July 2007

• 99 questions/Solutions/61A
  Collect the leaves of a binary tree in a list leaves :: Tree a -> [a]
  615 bytes (90 words) - 13:39, 25 December 2016
• Principal variation search
  import Data.Tree pvs :: (Num a1, Ord a1) => a1 -> a1 -> [Tree (a, a1)] -> ([a], a1)
  6 KB (723 words) - 03:47, 8 October 2006

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