Search results

• 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
• 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
• Abstract data type
  ===Tree=== data Tree a = Nil
  5 KB (872 words) - 13:14, 2 September 2014
• Haskell Quiz/Secret Santas/Solution Kuklewicz
  -- A complete binary tree, of leaves and internal nodes. -- Invariant: card >=2. All internal tree nodes are always full.
  5 KB (840 words) - 10:56, 13 January 2007
• Denotative
  data Tree a = Node a [Tree a] dfs :: Graph -> [Vertex] -> [Tree Vertex]
  4 KB (488 words) - 04:24, 5 April 2024
• HIDE/Design/Project management
  ...ct for the project management. Each project has a single root of its build tree. At the moment we expect there to be at most one .cabal file in that root d === Setting the build tree root ===
  9 KB (1,516 words) - 12:14, 24 January 2006
• Show and Read instance
  .../pipermail/glasgow-haskell-users/2003-August/005586.html Show instance for Tree]
  744 bytes (109 words) - 14:32, 13 November 2006
• 99 questions/54A to 60
  A binary tree is either empty or it is composed of a root element and two successors, whi data Tree a = Empty | Branch a (Tree a) (Tree a)
  9 KB (1,368 words) - 02:54, 11 June 2023
• Himerge/En
  ...]] || ''sync'' || Update our portage tree or overlay with latest available tree on the mirrors.
  2 KB (296 words) - 07:54, 18 February 2008
• GeBoP
  ...s a brain viewer which enables you to explore the computer's internal game tree. To see the game tree, select <i>Brain</i> -> <i>Open</i>.
  1 KB (231 words) - 13:25, 16 March 2018
• 99 questions/Solutions/70
  (**) Tree construction from a node string. ...of its nodes, a special character ^ has been inserted whenever, during the tree traversal, the move is a backtrack to the previous level.
  7 KB (1,025 words) - 02:14, 23 July 2021
• Benchmarks Game/Parallel/BinaryTrees
  -- an artificially strict tree. data Tree = Nil | Node !Int !Tree !Tree
  6 KB (1,055 words) - 23:27, 18 April 2020
• Yhc/Options
  --parse show syntax tree after parser (default=off) --rename show syntax tree after rename (default=off)
  6 KB (733 words) - 15:19, 6 February 2021
• HaskLS
  * <bourbaki> boegel the idea is that ... ie think of the first think of the tree the root ...branches of changeing textures like makeing the bark darker where the tree is older or so
  3 KB (482 words) - 05:24, 30 November 2006
• Haskell Quiz/TicTacToe
  ...e player which learns to play the game by observing the game (i.e. no game tree traversal to find the optimal move).
  331 bytes (51 words) - 14:20, 23 August 2012

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