[LeetCode] Same Tree, Solution
来源:互联网 发布:mac虚拟机五国语言重启 编辑:程序博客网 时间:2024/06/05 17:57
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: }
0 0
- [LeetCode] Same Tree, Solution
- Leetcode - Tree - Same Tree
- [leetcode][tree] Same Tree
- LeetCode: Same Tree
- LeetCode Same Tree
- [Leetcode] Same Tree
- LeetCode : Same Tree
- [LeetCode] Same Tree
- leetcode 65: Same Tree
- Leetcode 100 Same Tree
- [leetcode] Same Tree
- [LeetCode]Same Tree
- [leetcode]Same Tree
- [Leetcode]Same Tree
- Leetcode: Same Tree
- [LeetCode] Same Tree
- LeetCode-Same Tree
- [leetcode] Same Tree
- [LeetCode] Search a 2D Matrix, Solution
- [LeetCode] Remove Duplicates from Sorted List II, Solution
- 端口被占用怎么办?
- [LeetCode] Unique Binary Search Trees, Solution
- [LeetCode] Unique Binary Search Trees II, Solution
- [LeetCode] Same Tree, Solution
- [LeetCode] Convert Sorted Array to Binary Search Tree, Solution
- [Interview] Serialize and De-serialize a tree
- [LeetCode] Path Sum, Solution
- [LeetCode] Regular Expression Matching, Solution
- 程序员生活八卦
- Mysql几种索引类型的区别及适用情况
- [LeetCode] Merge Intervals, Solution
- [LeetCode] Spiral Matrix II, Solution