Binary Search Tree

Binary Search Tree

1. Root (this is the topmost node in the tree)

   • Right Subtree: is always greater than the root
     • A Leaf is an element with no children of its ow
   • Left Subtree: is always less than the root
     • A node is an object that contains an element

2. non-linear Hierarchial Data Structure

3. Searching for an element

   • First check to see if there is more elements in the tree or is this the first
     • Next we check to see if the element is already in the tree
       • If Yes then the computer returns the node
       • If No then the computer recursively continue
         • We go the right if the element is GREATER
         • We go to the left if the element is SMALLER

4. Inserting an element

   • First, check if there is elements in the tree
     • If Yes, we begin the process at the root
     • If no we create our root
     • Next, we ask if the new element is greater than the current Node element
       • If Yes, we check if there is existing right child
         • If Yes, we recursively delegate to the right
         • If No, we create a new right child
       • If No, we check if there is an existing left child
         • If No, we create a new left child
         • If Yes, we recursively delegate to the left