previous | start | next

Insertion Algorithm - Node class

private class Node
{
   public void insertNode(Node newNode)
   {
      if (newNode.data.compareTo(data) < 0)
      {
         if (left == null) left = newNode;
         else left.insertNode(newNode);
      }
      else
      {
         if (right == null) right = newNode;
         else right.insertNode(newNode);
      }
   }
   . . .
}


previous | start | next