The Binary Tree Search

The Binary Tree Search

1. Hierarchical, non-linear

   • Node structure
     • repeatable elements
     • Children of Nodes

2. Used to optimize search and data retrieving in ordered set

   • KEY: Ordered
   • Left subtree< Root Node < Right subtree
     • Left child < current Node < right child

3. Root Node: First and Upper node

   • Leaves: Nodes without children nodes... almost like the youngest generation in a family tree
   • Node: Object contains an element

4. Recursively delegate to the right

   • when there is a right child
     • when there is a left child
       • recursively delegate to the left

5. Contains Data and pointer to left/ right elements