| Safe Haskell | Safe-Inferred |
|---|---|
| Language | Haskell2010 |
Traq.Primitives.TreeSearch
Synopsis
- data TreeSearch sizeT precT = TreeSearch {
- getChildren :: Ident
- getChildrenArgs :: [Ident]
- checkNode :: Ident
- checkNodeArgs :: [Ident]
Documentation
data TreeSearch sizeT precT #
Search a binary tree rooted at node 1.
getChildren returns the two child nodes.
If any is 0 it means there no node.
Both being 0 means the current node is a leaf.
checkNode returns a boolean value.
Constructors
| TreeSearch | |
Fields
| |