Binary Trees - The Binary Search Tree (BST)

Binary Trees - The Binary Search Tree (BST)

1. BINARY TREE

   • hierarchical
     • 1 Node can have up to 2 children
   • ROOT NODE
     • first and upper Node
   • LEAVES
     • Nodes without children Nodes

2. BINARY SEARCH TREE

   • Left Child < Current Node < Right Child
     • Left subtree < Root Node < Right subtree
   • INSERT ELEMENT
     • Are there elements in the Tree?
       • YES - start at the root
       • NO - create a new root
       • Is the new element greater than the current Node's element?
         • YES - Is there already a right child?
           • NO - new right child
           • YES - start process with right child
         • NO - Is there a left child?
           • YES - start process with left child
           • NO - new left child