[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]
递归判断左右子树是否相等。
[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: }
相关文章推荐
- [LeetCode] Same Tree, Solution
- Leetcode 100. Same Tree
- LeetCode : atoi My solution
- leetcode || 100、Same Tree
- [LeetCode] Same Tree
- leetcode-Same Tree
- 【Leetcode】【python】Same Tree
- [LeetCode]Same Tree
- LeetCode-Same Tree
- LeetCode No.100 Same Tree
- LeetCode - 70. Climbing Stairs - C++ - 3ms Solution
- [LeetCode] Same Tree
- LeetCode 100. Same Tree
- The Solution to LeetCode 15 3Sum改进版
- LeetCode - Same Tree
- [LeetCode 148] Sort List Solution
- leetcode(java):100 Same Tree
- LeetCode 100. Same Tree
- [LeetCode Solution 1] 236.Lowest Common Ancestor of a Binary Tree
- [LeetCode] Count and Say, Solution