Binary Trees

Binary Trees

1. Hierarchical Data Structure

   • Node
     • Left Subtree
     • Right Subtree
     • Example
       • 5
         • 8
           • 7
           • Leaves
         • 3
           • 4
           • 6
           • Node
         • ROOT!

2. Inserting Elements

   • Are there elements in the tree
     • yes
       • begin process at root
         • is the
     • no
       • create new root
         • Is the new element greater than the current nodes element
           • Yes
             • Is there a right child?
               • Yes
                 • Recursive function to delegate to right or left
               • No
                 • Need new right child
           • No
             • Is there a left child?
               • Yes
                 • Recursive function to delegate to right or left
               • No
                 • Need new left child

3. Search element in BST

   • Are there elements in the tree?
     • Yes
       • Begin the Process at the root
     • Does the node have the element?
       • Yes
         • Return the node
       • No
         • Recursively delegate depending whether is it smaller or larger