Introduction to Binary Search Tree (BST) || AVL || AA || SPLAY Trees
At the end of this week, the students will understand the concept of the Binary Search Tree (BST). They will learn different operations that can be performed on the BST. They will learn the running time of BST. In addition, the students will also understand the concept of AVL, Red-Black, AA, and Splay trees.