Same Tree判断二叉树相等

Given two binary trees, write a function to check if they are equal or not.

Two binary trees are considered equal if they are structurally identical and the nodes have the same value.

验证二叉树是否完全相等，即结构也要完全相同

public static boolean isSameTree2(TreeNode p, TreeNode q){
	   return Traverse(p,q);
	   }
	 public static boolean Traverse(TreeNode p, TreeNode q){ //结构也必须相等 
        if(p == null) { if(q != null) return false; }  
        if(q == null) { if(p != null) return false; }  
          
        if(p == null && q == null) return true;  
          
        if(p.val != q.val) return false;  
          
        if(p.left == null) { if(q.left != null) return false; }  
        if(p.right == null) { if(q.right != null) return false; }  
          
        if(!Traverse(p.left, q.left)) return false;  
        if(!Traverse(p.right, q.right)) return false;  
          
        return true;  
    }  

另一种做法 from web

public boolean isSameTree(TreeNode p, TreeNode q) {
        if(p==null&&q==null){
            return true;
        }
        if(p==null&&q!=null||q==null&&p!=null||p.val!=q.val){
            return false;
        }
        return isSameTree(p.left,q.left)&&isSameTree(p.right,q.right);
    }
}

2

另外一种是忽视结构，则可以将二叉树遍历，然后比较元素

static ArrayList<Integer> a=new ArrayList<Integer>();
	static ArrayList<Integer> b=new ArrayList<Integer>();
    public static boolean isSameTree(TreeNode p, TreeNode q) {//只要意义相同，即序列相等
        preOrder(p,a);
		preOrder(q,b);
		 
		int i=0,j=0;
		if(a.size()!=b.size())// {} ,{0}
		  return false;
		if(a.size()==0)//{} ,{}
          return true;		
		for(;i<a.size();i++,j++)
		  if(a.get(i)!=b.get(j))
		   return false;
		return true;   
    }
	public static void  preOrder(TreeNode T,ArrayList<Integer> s){
      if(T!=null){
	  s.add(T.val);
	  preOrder(T.left,s);
	  preOrder(T.right,s);
	  }
	  return ;
	}