您的位置:首页 > 其它

[LeetCode] Same Tree, Solution

2013-03-22 13:33 323 查看
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.» Solve this problem

[Thoughts]
递归判断左右子树是否相等。

[code]1:    bool isSameTree(TreeNode *p, TreeNode *q) {
2:      if(!p && !q) return true;
3:      if(!p || !q) return false;
4:      return (p->val == q->val) &&
5:           isSameTree(p->left, q->left) &&
6:           isSameTree(p->right, q->right);
7:    }
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签: