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
判断两颗二叉树是否相等。
对比每一个节点是否相同。
节点相同的条件：值相等，左右孩子相同。
1 /** 2 * Definition for a binary tree node. 3 * struct TreeNode { 4 * int val; 5 * TreeNode *left; 6 * TreeNode *right; 7 * TreeNode(int x) : val(x), left(NULL), right(NULL) {} 8 * }; 9 */ 10 class Solution { 11 public: 12 bool isSameTree(TreeNode* p, TreeNode* q) { 13 if(p==nullptr&&q==nullptr) return true; 14 else if(p==nullptr||q==nullptr) return false; 15 else return (p->val==q->val)&&isSameTree(p->right,q->right)&&isSameTree(p->left,q->left); 16 17 } 18 };
原文：http://www.cnblogs.com/19q3/p/5492999.html