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

		treeNode leftMax = null;
		treeNode rightMax = null;
		treeNode minNode = root;

		if (root.leftLeaf != null) {
			leftMax = getMinNode(root.leftLeaf);
			if (leftMax.value < minNode.value) {
				minNode = leftMax;
			}
		}
		if (root.rightLeaf != null) {
			rightMax = getMinNode(root.rightLeaf);
			if (rightMax.value < minNode.value) {
				minNode = rightMax;
			}
		}

		return minNode;
	}