package tree;

public class BinaryTree
{

  private BSTNode root;


  public void addNode(int data){

    BSTNode nodeToAdd = new BSTNode(data);

    if (root == null){
      root = nodeToAdd;
    }

    traverse(root, nodeToAdd);

  }

  public void traverse(BSTNode node, BSTNode nodeToAdd)
  {

    if (nodeToAdd.data < node.data){

      if (node.leftChild == null){
        node.leftChild = nodeToAdd;
      }
      else {
      traverse(node.leftChild, nodeToAdd);
      }

    }

    if (nodeToAdd.data > node.data){

      if (node.rightChild == null){
        node.rightChild = nodeToAdd;
      }
      else {
      traverse(node.rightChild, nodeToAdd);
      }

    }

  }


}