判断两棵树是否相等 leecode

很简单  提交代码 https://oj.leetcode.com/problems/same-tree/

iven 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 binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ 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.val==q.val) { return isSameTree(q.left,p.left)&&isSameTree(q.right,p.right); } else { return false; } } }

  

posted @ 2014-06-29 02:03  hansongjiang8  阅读(487)  评论(0编辑  收藏  举报