Binary Tree

Binary Tree

1. Hierarchical data structure

   • Nodes
     • Root Nodes
       • First/upper node
     • Leaves
       • Nodes without children nodes
     • Object with element
     • Child Node
   • Root Node created
     • Next element that is > root will be its right child
       • Each child node will also their own right/left children following same rules
         • Branching continues until leaves
     • Next element that is < root will be left child

2. Used to optimize searching/retrieving data from ordered sets

   • Root node is checked for element
     • If root node satisfies condition
       • Return root node
     • If root node does not satisfy condition
       • If element is greater than root node
         • Check right child node for element
           • Recursive delegation continues until element is found
       • If element is less than root node
         • Check left child node for element