标签：
https://leetcode.com/problems/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 == 0 && q == 0) { return true; } if(p != 0 && q == 0) { return false; } if(p == 0 && q != 0) { return false; } if(p->val != q->val) { return false; } return isSameTree(p->left, q->left) && isSameTree(p->right, q->right); } };
简单的递归，不解释了。
标签：
原文地址：http://www.cnblogs.com/NickyYe/p/5049712.html
