100. Same Tree

最新推荐文章于 2021-01-13 12:07:05 发布

lxy598951

最新推荐文章于 2021-01-13 12:07:05 发布

阅读量142

点赞数

分类专栏： leetcode习题笔记

本文链接：https://blog.csdn.net/lxy598951/article/details/53012042

版权

leetcode习题笔记专栏收录该内容

13 篇文章 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_Solution:

<span style="background-color: rgb(255, 255, 255);"><span style="font-size:14px;">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 false;  
        return isSameTree(p.left,q.left) && isSameTree(p.right,q.right);  
    }  
}</span></span>