Crate binary_tree [−] [src]

Provides a collection of binary tree based data structures and algorithms.

Terminology

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.

count	Counting tree implementation.
cow	Copy-on-Write pointers.
iter	Generic iterators.
test	Data structures and algorithms for testing purposes.
unbox	Pointer unboxing.

List of actions during a Node::walk or NodeMut::walk_*.

BinaryTree
Node	Generic methods for traversing a binary tree.
NodeMut	Mutating methods on a Binary Tree node.