Building Tree Basics

Example #1

Recall that smaller values go left and equal or greater values to right.

Here is a simple example of a binary search tree (BST) where we have added the following values (in this order):

  20 10 40 30

                   20
                    |
      --------------+--------------
      |                           |
     10                          40
                            -----+
                            |
                           30

Example #2

Here is another example of a binary search tree (BST) where we have added the following values (in this order):

  50, 70, 20, 10, 60, 40, 30

Note that this tree is out of balance. We'll learn how to maintain a balanced tree.

                 50
                  |
          --------+--------
          |               |
          20              70
     -----+-----      -----+
     |         |      |
     10       40      60
         -----+
         |
        30