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.
Subscribe to see which companies asked this question
这个题目比较简单，只需要比较节点的值以及子树是否相等即可
/** * 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==NULL||q==NULL)return false; return p->val==q->val&&isSameTree(p->left,q->left)&&isSameTree(p->right,q->right); } };
原文：http://www.cnblogs.com/csudanli/p/5877097.html