UNIT - 3


Search Tree: 

Binary Search Tree - Definition, Implementation - click here

Binary Search Tree Operations- Searching, Insertion and Deletion - click here

Binary Search Tree (BST) Traversals – Inorder, Preorder, Post Order - click here

Convert a normal BST to Balanced BST - click here

AVL Trees: 

AVL Trees - Definition, Height of an AVL Tree, AVL vs Balanced BST- click here

Red –Black Trees - click here

Splay Trees - click here