leetcode刷题日记——Same Tree

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));

}
};