Binary Search Trees

Binary Search Trees

1. A type of binary tree

   • Root Node: First and upper node
   • Leaves: Nodes with children nodes
   • Node: Object that contains an element

2. Used to optimize search and data retrieval in ordered sets

3. Left Child < Current Node < Right Child

   • Left Subbtree < Root Node < Right Subtree

4. Tree Class

   • insert(int)
   • Tree()
   • search(int): Node
   • numberOfElements: int

5. Node Class

   • element: int
   • Node(int)
   • insertElement(int)
   • searchElement(int): Node