标签：check als log 解题思路 null des div ica tco
题目要求：
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.
判断两棵二叉树是否相等
解题思路：
递归思想（好像大多数关于二叉树的题目都可以用递归来解决）
1 /** 2 * Definition for binary tree 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 { 14 if(p == NULL && q == NULL) 15 return true; 16 else if(p == NULL || q == NULL) 17 return false; 18 19 if(p->val == q->val) 20 { 21 return (isSameTree(p->left, q->left) && (isSameTree(p->right, q->right))); 22 } 23 return false; 24 25 26 27 } 28 };
标签：check als log 解题思路 null des div ica tco
原文地址：http://www.cnblogs.com/htzhang0908/p/7076443.html
