Insertion Algorithm

• If you encounter a non-null node reference, look at its data value
  • If the data value of that node is larger than the one you want to insert,
    continue the process with the left subtree
  • If the existing data value is smaller,
    continue the process with the right subtree
• If you encounter a null node pointer, replace it with the new node