Binary Search Trees Exercises

   < Previous  Next >
  1. Draw the resulting Binary Search Tree after inserting the following strings (in the order provided):
    BS,  AVL,  TT,   TTF,   RB,  Splay
  2. Given the following Binary Search Tree, draw the resulting Binary Search Tree after removing B, then E.
    Binary search tree with the root node as B, it's left child is A and right child is E. E's left child is C and right child is F. C's left child is D.
  3. Draw the resulting Binary Search Tree after inserting the following strings (in the order provided):
    AVL,  BS,   RB,  Splay,  TT,   TTF
  4. Write in the Big-Oh for the following operations on a Binary Search Tree.
      Average Case     Worst Case  
    Retrieval    
    Insertion    
    Deletion    
    Traversal    

Last Modified: