public treeNode getMaxNode(treeNode root) {
		if (root == null)
			return null;

		treeNode leftMax = null;
		treeNode rightMax = null;
		treeNode maxNode = root;

		if (root.leftLeaf != null) {
			leftMax = getMaxNode(root.leftLeaf);
			if (leftMax.value > maxNode.value) {
				maxNode = leftMax;
			}
		}
		if (root.rightLeaf != null) {
			rightMax = getMaxNode(root.rightLeaf);
			if (rightMax.value > maxNode.value) {
				maxNode = rightMax;
			}
		}

		return maxNode;
	}