1 Binary Search Trees Implementing Balancing Operations –AVL Trees –Red/Black Trees Reading: 11.5-11.6.
Balanced Trees (AVL and RedBlack). Binary Search Trees Optimal Behavior ▫ O(log 2 N) – perfectly balanced tree (e.g. complete tree with all levels filled)
Balanced Trees (AVL and RedBlack)
