BST

• Binary Search Tree:

• Nodes have two children and are mathematically ordered such that:

  • All items present in the left subtree of a node N are “less than” the item stored at N.
  • All items present in the right subtree of a node N are “greater than” the item stored at N.