Source of 26.33.java

Structures and functions

  1: // Finds the node containing the largest entry in a given tree.
  2: // rootNode is the root node of the tree.
  3: // Returns the node containing the largest entry in the tree.
  4: // @author Frank M. Carrano, Timothy M. Henry
  5: // @version 5.0
  6: private BinaryNode<T> findLargest(BinaryNode<T> rootNode)
  7: {
  8:    if (rootNode.hasRightChild())
  9:       rootNode = findLargest(rootNode.getRightChild());

 11:    return rootNode;
 12: } // end findLargest