LeetCode 100. Same Tree
来源:互联网 发布:网游明星知乎 编辑:程序博客网 时间:2024/06/05 06:25
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题
class Solution {public: bool isSameTree(TreeNode* p, TreeNode* q) { if(!p && !q) return true; if(p && !q || !p && q) return false; if(isSameTree(p->left, q->left) && isSameTree(p->right, q->right) && p->val == q->val) return true; else return false; }};
0 0
- [LeetCode]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
- [leetcode] 100.Same Tree
- leetCode 100. Same Tree
- [LeetCode]100. Same Tree
- 100. Same Tree LeetCode
- LeetCode 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
- Ubuntu server 14.04下安装hadoop-2.6.4 集群机
- git简单操作
- 实训第三天--数字迷宫
- POJ 3281 Dining(最大流)
- EventBus 3.0 使用介绍
- LeetCode 100. Same Tree
- 渲染路径-实时渲染中常用的几种Rendering Path
- Elastic cache
- 串(String)--基本概念
- CXF和spring整合实现webservice实例(二)
- MyEclipse8.5 环境中配置Tomcat7.X
- Java运算符
- 自己认为好的博客(java+Android)
- 165. Compare Version Numbers(重要)