Same Tree

Leetcode

/** * 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 && !q) return true; if((!p && q) || (p && !q)) return false; if(p->val != q->val) { return false; } if(isSameTree(p->left, q->left) == false) return false; if(isSameTree(p->right, q->right) == false) return false; return true; } };
Home | © 2026 Last Updated: Aug 09, 2026
Buy Me A Coffee