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.
算法思路：
思路1：判断两棵树是否一样，可以根据中序遍历+前（后）序遍历序列得到。
实现略。
思路2：dfs判断
1 public class Solution { 2 public boolean isSameTree(TreeNode p, TreeNode q) { 3 if(p == null && q == null) return true; 4 if((q == null && p != null ) || (p == null && q != null ) || p.val != q.val) return false; 5 return isSameTree(p.left, q.left) && isSameTree(p.right, q.right); 6 7 } 8 }
[leetcode]Same Tree,布布扣,bubuko.com
原文：http://www.cnblogs.com/huntfor/p/3881588.html