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.
  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: