L10: AVL, B and B+ Tree

10.1 AVL Tree - Insertion and Rotations

no. of BST = (no. of nodes)! -> All depends on order of insertion duplicate are not allowed

height of bst max n min logn

AVL - Adelson-Velsky and Landi -Hight Balanced Binary sear tree

---

10.2 B Trees and B+ Trees. How they are useful in Databases