Next: bst unodes, Previous: bst intro, Up: bst [Index]
Binary search trees are composed of “binary node objects” linked
together in a tree hierarchy. The object type <binary-node>
is the base type of all the node types.
| • bst bnodes objects: | Binary node data type. | |
| • bst bnodes access: | Accessors and mutators for binary nodes. | |
| • bst bnodes pred: | Structure predicates for binary nodes. | |
| • bst bnodes inspect: | Inspecting binary trees. | |
| • bst bnodes searching: | Searching in binary trees. | |
| • bst bnodes iterating: | Iterating over binary trees. | |
| • bst bnodes validating: | Validating binary trees. |