Binary Trees

Binary Trees

1. Hierarchical data structure

   • Generally, each node is breaks off into left and right subtrees
     • Root: first and upper node
     • Leaves: Nodes without children nodes
     • Node: Object containing an element
   • Binary Search Trees
     • Left Child < Current Node < Right Child
       • Inserting an Element
         • Create root node
           • Is new element greater than current node's element?
             • If there is a right child, move right
               • If not, create new right child
             • If there is a left child, move left
               • If not, create new left child
       • Creating BST
         • Construct tree
           • Initialize root and number of elements
             • Create insert function that calls upon node function
         • Construct node
           • Initialize current, right, and left element
             • Create insert function based on element's value