判断两个二叉树是否相同

题目描述:  

        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.

算法思想：主要是递归和怎么样遍历二叉树

java 代码如下

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