Crate binary_tree [−] [src]
Provides a collection of binary tree based data structures and algorithms.
- The root of a tree is considered to be at the top.
- Height of a node is the length of the longest path to its leaves. Thus all leaf nodes have zero height.
Counting tree implementation.
Data structures and algorithms for testing purposes.
List of actions during a
Generic methods for traversing a binary tree.
Mutating methods on a Binary Tree node.