Total Accepted: 84900
Total Submissions: 203205
Difficulty: Easy
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.
判断所给定的两个二叉树判断是否相等
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* struct TreeNode *left;
* struct TreeNode *right;
* };
*/
bool isSameTree(struct TreeNode* p, struct TreeNode* q) {
if (p == NULL && q == NULL)
return true;
else if (p == NULL && q != NULL)
return false;
else if (q == NULL && p != NULL)
return false;
else {
if (p->val == q->val){
isSameTree(p->left, q->left) && isSameTree(p->right, q->right);
}
else
return false;
}
}
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* struct TreeNode *left;
* struct TreeNode *right;
* };
*/
bool isSameTree(struct TreeNode* p, struct TreeNode* q) {
if (p == NULL && q == NULL)
return true;
else if (p == NULL && q != NULL)
return false;
else if (q == NULL && p != NULL)
return false;
else {
if (p->val == q->val){
isSameTree(p->left, q->left) && isSameTree(p->right, q->right);
}
else
return false;
}
}