Expand description
This module contains an implementation of a classic binary search tree with a large set of methods, including view iterators.
Structsยง
- Binary
Search Tree - In this crate, binary search trees store only one valuable value, which is also
used as a key, so all elements must have the
Ordtrait implementation. - Inorder
Traversal - Level
Order Traversal - Postorder
Traversal - Preorder
Traversal - Reverse
Order Traversal