标签：
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;
if(p && q)
{
if((p->val == q->val) && isSameTree(p->left,q->left) && isSameTree(p->right,q->right)) return true;
}
return false;
}
};
标签：
原文地址：http://www.cnblogs.com/yuchenkit/p/5300693.html
