剑指offer18判断是不是二叉树的子树

public class Test{
public static
boolean aHasB(Btree A,Btree B) {
if(Bnull)return true; //顺序不能反
if(Anull)return false;
if(A.data!=B.data)return false;
return aHasB(A.left, B.left)&&aHasB(A.right, B.right);
}
public static boolean hasSubTree(Btree A,Btree B) {
boolean res = false;
if(A!=null&&B!=null) {
if(A.data==B.data) {
res=aHasB(A, B);
}
if(!res){
res=hasSubTree(A.left, B);
}
if(!res) {
res=hasSubTree(A.right, B);
}
}
return res;
}
public static void main(String[] args) {
Btree A1=new Btree(1);
Btree A2=new Btree(2);
Btree A3=new Btree(3);
Btree A4=new Btree(4);
Btree A5=new Btree(5);
A1.left=A2;
A1.right=A3;
A2.left=A4;
A2.right=A5;
Btree B1=new Btree(1);
Btree B2=new Btree(2);
Btree B3=new Btree(3);
Btree B4=new Btree(4);
B1.left=B2;
B1.right=B3;
B2.left=B4;
System.out.println(hasSubTree(A1, B1));
}
}
class Btree{
int data;
Btree left;
Btree right;
Btree(int x){
data=x;
}
}