4.0

Topic： For Trees, inserInOrder and judge whether isBST

	public void insertInOrder(int d) {
		if (d <= data) {
			if (left == null) {
				setLeftChild(new TreeNode(d));
			} else {
				left.insertInOrder(d);
			}
		} else {
			if (right == null) {
				setRightChild(new TreeNode(d));
			} else {
				right.insertInOrder(d);
			}
		}
	}
	
	public boolean isBST() {
		if (left != null) {
			if (data < left.data || !left.isBST()) {
				return false;
			}
		}
		if (right != null) {
			if (data >= right.data || !right.isBST()) {
				return false;
			}
		}	
		return true;
	}

public TreeNode find(int d) {
  if (d == data) {
   return this;
  } else if (d <= data) {
   return left != null ? left.find(d) : null;
  } else if (d > data) {
   return right != null ? right.find(d) : null;
  }
  return null;
 }