Lecture07 Binary Trees II

Height Balance
AVL Tree
Def. Every node of an AVL Tree is height-balanced where the left and right subtrees of a height-balanced node differ in height by at most

1

1

1.
Rotations
If a tree is imbalanced after a bunch of operations of adding or removing nodes, we will want to change the structure of the tree without changing i

Lecture07 Binary Trees II最先出现在Python成神之路。