previous | start | next

Insertion Algorithm - Tree class

class Tree
{
   . . .
   public void insert(Comparable obj)
   {
      Node newNode = new Node();
      newNode.data = obj;
      newNode.left = null;
      newNode.right = null;
      if (root == null) root = newNode;
      else root.insertNode(newNode);
   }
   . . .
}


previous | start | next