0100-same-tree.cpp

/*
100. Same Tree

Submitted: December 9, 2024

Runtime: 0 ms (beats 100.00%)
Memory: 12.76 MB (beats 15.77%)
*/

/**
 * 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) {}
 * };
*/
classSolution {
public:
boolisSameTree(TreeNode* p, TreeNode* q) {
if (p == nullptr || q == nullptr) return p == q;
if (p->val != q->val) returnfalse;
returnisSameTree(p->left, q->left) && isSameTree(p->right, q->right);
 }
};