100. Same Tree
来源:互联网 发布:久量led台灯 知乎 编辑:程序博客网 时间:2024/06/02 05:03
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.
题目翻译: 给两棵树,写一个函数来判断这两棵树是否相同. 我们判定一棵树是否相同的条件为这两棵树的结构相同,并且每个节点的值相同;
解题思路: 这道题中规中矩,很简单,我们直接用DFS前序遍历这两棵树就可以了.
时间复杂度分析: 因为是DFS, 所以时间复杂度为O(n)
代码如下:
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
bool isSameTree(TreeNode *p, TreeNode *q) {
if(p == NULL && q == NULL)
return true;
else if(p == NULL || q == NULL)
return false;
if(p->val == q->val)
{
bool left = isSameTree(p->left, q->left);
bool right = isSameTree(p->right,q->right);
return left&&right;
}
return false;
}
};
- [LeetCode]100.Same Tree
- LeetCode 100. Same Tree
- 100.Same Tree
- 【LeetCode】100.Same Tree
- [Leetcode] 100. Same Tree
- [Leetcode] 100. Same Tree
- LeetCode --- 100. Same Tree
- LeetCode 100. Same Tree
- [leetcode] 100.Same Tree
- 100.Same Tree
- 100. Same Tree
- 100.Same Tree
- 100. Same Tree
- 100. Same Tree
- 100. Same Tree
- leetCode 100. Same Tree
- 100. Same Tree
- [LeetCode]100. Same Tree
- 转载HashMap
- 埋点的详细介绍与理解
- Vi下使用TAB
- mxnet系列 tools 查看params的内容
- 青蛙跳台阶--尾递归优化
- 100. Same Tree
- 如何在Ubuntu 14.04上利用HAProxy作为WordPress应用服务器的4层负载均衡器
- 计算机图形学-实验1-掌握开发环境配置方法和基本图元绘制函数
- ImageLoader
- Kali下安装Shadowsocks与利用ss和ProxyChains实现任意应用代理
- Windows环境下docker的安装与配置
- SQL数据类型nchar,char,varchar与nvarchar区别
- PCA的数学原理
- Spark机器学习库(MLlib)官方指南手册中文版