Module 4: Index Structures
  Lecture 13: Index structure
 

                                           

 

 

Binary search tree (BST)
  • Binary tree
  • Unbalanced
  • If a node has key , then every key in left subtree and every key in
    right subtree follows the properties:
 
 
  • Searching, insertion, deletion takes time on average.
  • Worst-case times are due to unbalanced property.
  • AVL-trees, Red-black trees, etc. are balanced.