1: // @author Frank M. Carrano, Timothy M. Henry 2: // @version 5.0 4: public int getHeight() 5: { 6: return getHeight(this); // Call private getHeight 7: } // end getHeight 9: private int getHeight(BinaryNode<T> node) 10: { 11: int height = 0; 12: 13: if (node != null) 14: height = 1 + Math.max(getHeight(node.getLeftChild()), 15: getHeight(node.getRightChild())); 16: 17: return height; 18: } // end getHeight 20: public int getNumberOfNodes() 21: { 22: int leftNumber = 0; 23: int rightNumber = 0; 25: if (left != null) 26: leftNumber = left.getNumberOfNodes(); 27: 28: if (right != null) 29: rightNumber = right.getNumberOfNodes(); 30: 31: return 1 + leftNumber + rightNumber; 32: } // end getNumberOfNodes