Leetcode55: Same Tree
来源:互联网 发布:哈佛 extension 知乎 编辑:程序博客网 时间:2024/06/05 11:45
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.
/** * 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; return p->val == q->val && isSameTree(p->left, q->left) && isSameTree(p->right, q->right); }};
0 0
- Leetcode55: Same Tree
- Same Tree
- Same Tree
- Same Tree
- Same Tree
- Same Tree
- Same Tree
- Same Tree
- Same Tree
- Same Tree
- Same Tree
- Same tree
- Same Tree
- Same Tree
- Same Tree
- Same Tree
- Same Tree
- Same Tree
- 条件变量与互斥锁
- cocos2d-x 利用CCLabelTTF制作文字描边与阴影效果的实现方法
- Android Studio 快捷键整理分享-SadieYu
- Mybatis批量更新和插入数据
- 花生壳端口映射实例说明
- Leetcode55: Same Tree
- 机器学习练习平台
- quick-lua 3.5 工程 cocos code ide 1.2.0 断点调试
- oracle数据库中使用sql将clob转化为字符串
- 操作系统典型调度算法简介
- Java压缩文件
- Maven建立基于jetty容器的简单的web工程
- 延时执行的几种方式
- 为什么局域网内做服务器要在路由器上做端口映射?