LeetCode 100. Same Tree 判断两棵二叉树是否相等

Posted 木落长安rr

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了LeetCode 100. Same Tree 判断两棵二叉树是否相等相关的知识,希望对你有一定的参考价值。

Given two binary trees, write a function to check if they are the same or not.

Two binary trees are considered the same if they are structurally identical and the nodes have the same value.

Example 1:

Input:     1         1
          /        /          2   3     2   3

        [1,2,3],   [1,2,3]

Output: true

Example 2:

Input:     1         1
          /                    2             2

        [1,2],     [1,null,2]

Output: false

Example 3:

Input:     1         1
          /        /          2   1     1   2

        [1,2,1],   [1,1,2]

Output: false

方法一:使用递归(C++)

1 bool isSameTree(TreeNode* p, TreeNode* q) {
2         if(p==NULL&&q==NULL)
3             return true;
4         if((!p&&q)||(p&&!q)||(p->val!=q->val))
5             return false;
6         return isSameTree(p->left,q->left)&&isSameTree(p->right,q->right);
7     }

 

以上是关于LeetCode 100. Same Tree 判断两棵二叉树是否相等的主要内容,如果未能解决你的问题,请参考以下文章

[leetcode] 100 Same Tree

[LeetCode]题解(python):100 Same Tree

小程序 - leetcode 100. Same Tree

LeetCode(100):Same Tree

LeetCode100. Same Tree 解题报告

leetcode-- 100. Same Tree