Balance Tree Series "1" from two fork find tree talk about balance tree

This konjac Konjac can not tell when it will be updated.

#0 Pre

A tree is an abstract data structure that has a strong vitality.

Essentially a tree is a special case of a graph, but the particular nature of the tree makes it much more convenient to deal with the graph.

And the binary tree is a special case of the tree, so through the binary tree, we have a variety of data structures. Binary tree diagram is rare, but it is common for data structures. Why is it? The binary tree has a friendly nature as follows:

1> two fork, just record left and right son
2> the implementation of the convenient rotation (will speak later)
3> h (full two fork tree) =o (log n)

Balance Tree Series "1" from two fork find tree talk about balance tree