mirror of
https://gitlab.com/mfocko/LeetCode.git
synced 2024-11-10 00:09:06 +01:00
problems(cpp): add „100. Same Tree“
Signed-off-by: Matej Focko <me@mfocko.xyz>
This commit is contained in:
parent
63dad4c93c
commit
ec2b3df836
1 changed files with 30 additions and 0 deletions
30
problems/same-tree.cpp
Normal file
30
problems/same-tree.cpp
Normal file
|
@ -0,0 +1,30 @@
|
||||||
|
/**
|
||||||
|
* Definition for a binary tree node.
|
||||||
|
* struct TreeNode {
|
||||||
|
* int val;
|
||||||
|
* TreeNode *left;
|
||||||
|
* TreeNode *right;
|
||||||
|
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
|
||||||
|
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
|
||||||
|
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
|
||||||
|
* };
|
||||||
|
*/
|
||||||
|
class Solution {
|
||||||
|
public:
|
||||||
|
bool isSameTree(TreeNode* p, TreeNode* q)
|
||||||
|
{
|
||||||
|
if (p == nullptr && q == nullptr) {
|
||||||
|
return true;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (p == nullptr || q == nullptr) {
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (p->val != q->val) {
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
|
||||||
|
return isSameTree(p->left, q->left) && isSameTree(p->right, q->right);
|
||||||
|
}
|
||||||
|
};
|
Loading…
Reference in a new issue