java二叉树的建立与应用代码

Tree<String> a1 = new Tree<String>("a1");
a1.setLeftChild(a11);
a1.setRight(a12);
Tree<String> b11 = new Tree<String>("b11");
Tree<String> b1 = new Tree<String>("b1");
public class Tree<T> {//定义一个二叉树类
private T root;
public T getRoot() {
return root;
}
public void setRoot(T root) {
this.root = root;
}
//get()函数与set()函数成对出现，来设定变量的值
public Tree<T> getLeftChild() {
return leftChild;
}
public void setLeftChild(Tree<T> leftChild) {
this.leftChild = leftChild;
}
public Tree<T> getRight() {
return right;
}
}
if(!leftChild.isEmptyTree() && leftChild.exists(data)) return true;
if(!right.isEmptyTree() && right.exists(data)) return true;
}
return false;
}
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Tree<String> a11 = new Tree<String>("a11");
Tree<String> a12 = new Tree<String>("a12");
b1.setRight(b11);
Tree<String> a = new Tree<String>("a");
a.setLeftChild(a1);
a.setRight(b1);
String c11 = null;//定义一个字符串型的变量c11，初始值为null
System.out.print(a.exists(c11));//判断二叉树a中是否含有c11
}பைடு நூலகம்
public void setRight(Tree<T> right) {
this.right = right;
}
private Tree<T> leftChild;
private Tree<T> right;
public Tree(T root) {
this.root= root;
}
public boolean isEmptyTree() {
return root==null;
}
public boolean exists(T data) {
if(root==null) return false;
if(data!=null) {
if(!isEmptyTree() && root.equals(data)) return true;//如果树不空，而且根等于data返回true