• a Binary Search Tree (BST) is an ordered Binary Tree such that
  • any root is greater than any element in its left subtree
  • any root is less than any element in its right subtree
  • not necessarily balanced !

generateBST

insert

search

delete

Runtime Analysis