Please enable JavaScript.
Coggle requires JavaScript to display documents.
AVL Trees - Coggle Diagram
AVL Trees
Definition
An AVL tree is a binary search tree in which the balance factor of every node, which is defined as the difference between the heights of the node's left and right subtrees, is either 0, +1 or -1. The height of the empty tree is -1.
Rotations Type
If an insertion of a new node makes an AVL tree unbalanced, we transform the tree by a rotation. A rotation in an AVL tree is a local transformation of its subtree rooted at a node whose balance has become either +2 or -2
-
-
-
-
-