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 Solution:
Runtime beats 23.17%
完成日期：07/01/2017
关键词：Tree
关键点：利用preOrder 来遍历tree；利用&&来控制左右两个children返回的都是true，才等于true。
1 /** 2 * Definition for a binary tree node. 3 * public class TreeNode { 4 * int val; 5 * TreeNode left; 6 * TreeNode right; 7 * TreeNode(int x) { val = x; } 8 * } 9 */ 10 public class Solution 11 { 12 public boolean isSameTree(TreeNode p, TreeNode q) 13 { 14 if(p == null && q == null) 15 return true; 16 if(p == null || q == null) 17 return false; 18 19 if(p.val != q.val) 20 return false; 21 22 23 return isSameTree(p.left, q.left) && isSameTree(p.right, q.right); 24 25 } 26 }
参考资料：N/A
LeetCode 100. Same Tree （相同的树）
原文：http://www.cnblogs.com/jimmycheng/p/7103609.html