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; * struct TreeNode *left; * struct TreeNode *right; * }; */ bool isSameTree(struct TreeNode* p, struct TreeNode* q) { bool left, right; if(p == NULL && q == NULL) return true; else if(p == NULL && q != NULL) return false; else if(p != NULL && q == NULL) return false; else if(p->val == q->val) { left = isSameTree(p->left, q->left); right = isSameTree(p->right, q->right); return (left && right); } else return false; }
原文：http://www.cnblogs.com/dylqt/p/4870063.html