https://leetcode.com/problems/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.
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 public static boolean isSameTree(TreeNode p, TreeNode q) { 12 if(p==null&&q==null) return true; 13 if(p==null||q==null) return false; 14 if(p.val==q.val) 15 return(isSameTree(p.left, q.left)&&isSameTree(p.right, q.right)); 16 return false; 17 } 18 }
原文：http://www.cnblogs.com/qq1029579233/p/4471800.html