首页 > 其他 > 详细

Leetcode Same Tree

时间:2015-09-14 07:02:10      阅读:174      评论:0      收藏:0      [点我收藏+]

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 code:

 public boolean isSameTree(TreeNode p, TreeNode q) {
        //use recursive
        if(p == null && q == null) {
            return true;
        }
        if(p == null || q == null) {
            return false;
        }
        return (p.val == q.val) && isSameTree(p.left, q.left) && isSameTree(p.right, q.right);
    }

Reference:

1. http://www.cnblogs.com/springfor/p/3879575.html

 

Leetcode Same Tree

原文:http://www.cnblogs.com/anne-vista/p/4806013.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!