Balanced two-pronged tree

The Balanced binary tree (Balanced binary trees) is also known as the AVL tree (unlike the AVL algorithm) and has the following properties: It is an empty tree or its left and right two subtree of the absolute value of the difference is not more than 1, and the left and right two sub-trees are a balanced binary tree. The common realization methods of balanced binary tree are red-black tree, AVL, scapegoat tree, treap, stretching tree, etc. The formula for the node of the minimum binary balance tree is as follows F (n) =f (n-1) +f (n-2) +1 This is similar to a recursive sequence, can refer to the Fibonacci (Fibonacci) sequence, 1 is the root node, F (n-1) is the number of nodes of Zuozi, F (n-2) is the number of nodes of the right subtree.

The key is his balance algorithm.

Follow-up will continue to study

Balanced two-pronged tree