二叉树的基本方法

private int height(TreeNode subTree){ //树的高度
if(subTree == null)
return 0;
else{
int i = height(subTree.left);
int j = height(subTree.right);
return (i > j)?(i + 1):(j + 1);
}
}


private int size(TreeNode subTree){ //树的节点个数
if(subTree == null)
return 0;
return 1 + size(subTree.left) + size(subTree.right);
}


public boolean search(E e){ //查找元素
TreeNode<E> current = root;
while(current != null){
if(current.element.compareTo(e) < 0){
current = current.right;
}
else if(current.element.compareTo(e) > 0){
current = current.left;
}
else{
return true;
}
}
return false;
}


public boolean insert(E e){ //插入元素
if(root == null) root = creatNewNode(e);
else{
TreeNode<E> current = root;
TreeNode<E> parrent = null;
while(current != null){
if(e.compareTo(current.element) < 0){
parrent = current;
current = current.left;
}
else if(e.compareTo(current.element) > 0){
parrent = current;
current = current.right;
}
else
return false;
}
current = creatNewNode(e);
}
return true;
}