Leetcode 100. Same Tree

最新推荐文章于 2022-03-19 13:19:57 发布

lyh_xd

最新推荐文章于 2022-03-19 13:19:57 发布

阅读量212

点赞数

分类专栏： C++ Leetcode 二叉树文章标签：二叉树 leetcode

本文链接：https://blog.csdn.net/liudaxia1990/article/details/51484959

版权

Leetcode 同时被 3 个专栏收录

75 篇文章 0 订阅

订阅专栏

C++

36 篇文章 0 订阅

订阅专栏

二叉树

11 篇文章 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.

树结构常用递归算法

bool isSameTree(TreeNode *p, TreeNode *q) {
    if (p == NULL || q == NULL) return (p == q);
    return (p->val == q->val && isSameTree(p->left, q->left) && isSameTree(p->right, q->right));
}