leetcode Same Tree
2014-08-20 12:39
288 查看
判断两棵二叉树是否相同,则可以用相同的方法分别遍历二叉树
注意判断过程中的细节问题
代码
注意判断过程中的细节问题
代码
class Solution { public: bool isSameTree(TreeNode *p, TreeNode *q) { if(p==q&&p==NULL) return true; if((!p&&q)||(p&&!q)) return false; if(p->val!=q->val) return false; bool left = isSameTree(p->left, q->left); bool right = isSameTree(p->right, q->right); return ((left==right)&&(left==true))?true:false; } };
相关文章推荐
- Same Tree leetcode java
- Leetcode Same Tree
- 【一天一道LeetCode】#100. Same Tree(100题大关)
- Leetcode:Same Tree 菜鸟解法
- 【LeetCode从零单排】No100 Same Tree && No101 Symmetric Tree
- LeetCode Same Tree
- [leetcode.com]算法题目 - Same Tree
- LeetCode-- Same Tree & Symmetric Tree
- LeetCode Same Tree
- LeetCode 100:Same Tree
- LeetCode--Same Tree
- Leetcode Same Tree
- leetcode: sametree
- LeetCode Same Tree
- Leetcode: Same Tree
- 【leetcode】比较两棵二叉树是否相同(Same Tree)
- leetcode之same tree
- Same Tree Leetcode c#
- Leetcode 之Same Tree(48)
- LeetCode Same Tree