Description
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.
Code
/**
* 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) {
return s(p,q);
}
private:
bool s(TreeNode* p, TreeNode* q){
if (!p && !q) return true;
if (!p || !q) return false;
return (p->val == q->val) && s(p->left, q->left) && s(p->right, q->right);
}
};
Appendix
- Link: https://leetcode.com/problems/same-tree/
- Run Time: 3ms