标签：
Same Tree【100】
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.
思路：之前做的二叉树的问题基本都会用到递归，这道题也是，判断两个树是否相等
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ public class Solution { public boolean isSameTree(TreeNode p, TreeNode q) { boolean result = false; if(p==null&&q==null) result = true; else if((p==null&&q!=null)||(p!=null&&q==null)) result = false; else{ if(p.val==q.val) result = isSameTree(p.left,q.left)&&isSameTree(p.right,q.right); } return result; } }
标签：
原文地址：http://www.cnblogs.com/lucky-star-star/p/4955508.html
