Leetcode 100 Same Tree
来源:互联网 发布:centos和ubuntu哪个好 编辑:程序博客网 时间:2024/06/08 14:27
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 || !q) { if(!p && !q) return true; return false; } if(p->val!=q->val) return false; return isSameTree(p->left,q->left) && isSameTree(p->right,q->right); }};
1 0
- Leetcode 100 Same Tree
- LeetCode(100)Same Tree
- LeetCode 100 Same Tree
- LeetCode: Same Tree [100]
- [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
- leetcode-100-Same Tree
- Leetcode # 100 Same Tree
- leetCode #100 same tree
- leetcode: (100) Same Tree
- UML中的事物
- maven 手工添加oracle 驱动jar 到本地仓库
- 基于阿里云的maven配置
- 一起来搭建像Qt一样的win32图形框架(2)
- Round B APAC Test 2017 Problem C. Watson and Intervals
- Leetcode 100 Same Tree
- UML准备
- hdu 5884 Sort(二分+哈夫曼树(队列))
- 关闭layer组件当前的弹层的方法
- http://blog.csdn.net/CaspianSea/article/details/43014525
- 【C++】【PAT】1050螺旋矩阵
- 环形缓冲区的实现原理(ring buffer)
- 农场一头小母牛,每年生头小母牛,母牛5岁产母牛,20年上多少牛?--java面向对象方式实现
- 用RNN处理单词向量