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.
题意：判断两棵树相同位置的val值是否相同。
思路：采用递归的方法。
代码：
public class Solution { public boolean isSameTree(TreeNode p, TreeNode q) { if(p==null&&q==null) return true; if(p==null&&q!=null) return false; if(p!=null&&q==null) return false; if(p.val==q.val) return isSameTree(p.left,q.left)&&isSameTree(p.right,q.right); else return false; } }
原文：http://www.cnblogs.com/Lewisr/p/5232188.html