leetcode刷題日記——Same Tree
阿新 • • 發佈：2019-01-28
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;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
bool isSameTree(TreeNode* p, TreeNode* q) {
if(p==NULL&&q==NULL)
return true;
else if(p==NULL||q==NULL)
return false;
else
return (p->val==q->val&&isSameTree(p->left,q->left)&&isSameTree(p->right,q->right));
}
};