码迷,mamicode.com
首页 > 其他好文 > 详细

[leetcode] 100. Same Tree 解题报告

时间:2016-09-05 00:09:14      阅读:94      评论: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.

递归遍历

一刷:

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

 

[leetcode] 100. Same Tree 解题报告

标签:

原文地址:http://www.cnblogs.com/pulusite/p/5840735.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!