Skip to content

A better C++ solution for problem 100: #405

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
kill3rstabs wants to merge 2 commits into
base: master
Choose a base branch
from
Open

A better C++ solution for problem 100: #405

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
227367b
A better C++ solution for problem 100:
kill3rstabs Sep 11, 2023
bdf1a69
More Compact Solution
kill3rstabs Sep 12, 2023
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
25 changes: 2 additions & 23 deletions C++/100_Same_Tree.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,27 +1,6 @@
/**
* 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->right,q->right) && isSameTree(p->left, q->left));
return (!p && !q) || (p && q && p->val == q->val && isSameTree(p->left, q->left) && isSameTree(p->right, q->right));
}
};

// Complexity Analysis:
// Time complexity : O(N), where N is a number of nodes in the tree, since one visits each node exactly once.
// Space complexity :O(log(N)) in the best case of completely balanced tree and O(N) in the worst case of completely unbalanced tree.
};