AVL Tree Implementation

1. Definition

An AVL tree is a 1 of the height of the right subtree of each node of the Saozi two-fork lookup tree (the height of the empty tree is defined as-1)

In an AVL tree with height H, the minimum number of nodes is given by S (h) =s (h-1) +s (h-2) +1. The function S (h) is related to the Fibonacci number.

The Re-balancing node is called a after the insert operation. The imbalance has 4 cases:

(1) Insert the left sub-tree of A's left son

(2) Insert the right sub-tree of A's left son

(3) Insert the left sub-tree of A's right son

(4) Insert the left sub-tree of A's right son

Wherein (1) (4) The situation is adjusted by single rotation, (2) (3) by double rotation to adjust

AVL Tree Implementation