【Leetcode】100. Same Tree 【DFS】

最新推荐文章于 2022-03-18 22:16:43 发布

renxingzhadan

最新推荐文章于 2022-03-18 22:16:43 发布

阅读量399

点赞数

分类专栏： leetcode 文章标签：函数递归遍历 leetcode

本文链接：https://blog.csdn.net/renxingzhadan/article/details/52250554

版权

leetcode 专栏收录该内容

41 篇文章 0 订阅

订阅专栏

100. Same Tree

Total Accepted: 147130
Total Submissions: 333400
Difficulty: Easy

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.

Subscribe to see which companies asked this question

1、递归 DFS

2、不能遍历输出再比较，

10 10

/ / \

5 5 15

是不一样的。

代码：

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

非递归实现参考：http://www.cnblogs.com/ganganloveu/p/4136259.html

里面用的层次遍历。