Chapter 3
More About Search – Search Trees and Hash Tables
Section 2
Self-Balancing Binary Search Tree
A binary search tree that remains balanced to some extent when insertion and deletion are carried out is called a self-balancing binary search tree. This video is one step further than the previous video. - Perform rotation on tree. Look at the AVL tree - Find complexity of searching, finding, and deleting elements