Previous: bst bnodes, Up: bst [Index]
The unbalanced binary search trees support insertion and removal of nodes without implementing any balancing algorithm. The performance of these trees is low, but they are useful for debugging purposes.
| • bst unodes objects: | Unbalanced binary node data type. | |
| • bst unodes ops: | Operations on unbalanced trees. |