向二叉树搜索树中添加元素，并按从小到大输出

public class Main454 {
	public static class BiTree{
		public int value;
		public BiTree left;
		public BiTree right;
		public BiTree(int data) {
			this.value = data;
		}
		public void add(BiTree the) {
			if(the.value<value) {
				if(left==null) {
					left=the;
				}else {
					left.add(the);
				}
			}else {
				if(right==null) {
					right=the;
				}else {
					right.add(the);
				}
			}
		}
		// 中序遍历
		public void mid_trav() {
			if(left != null) left.mid_trav();
			System.out.println(value);
			if(right != null) right.mid_trav();
		}
	}
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		BiTree root = new BiTree(100);
		root.add(new BiTree(50));
		root.add(new BiTree(80));
		root.add(new BiTree(40));
		root.add(new BiTree(35));
		root.mid_trav();
	}
}