leetcode 101. Symmetric Tree
2017-03-16 23:30
330 查看
题目:
要求判断一棵二叉树是否对称
思路:采用递归的办法,直接比较对称位置,即将left的left和right的right比较,left的right和right的left比较。时间复杂度为O(n)。
代码AC:
要求判断一棵二叉树是否对称
思路:采用递归的办法,直接比较对称位置,即将left的left和right的right比较,left的right和right的left比较。时间复杂度为O(n)。
代码AC:
相关文章推荐
- LeetCode 101. Symmetric Tree
- LeetCode:101. Symmetric Tree
- C++详解Leetcode:101. Symmetric Tree
- LeetCode#101. Symmetric Tree
- <LeetCode OJ> 101. Symmetric Tree
- LeetCode 101. Symmetric Tree
- [LeetCode]101. Symmetric Tree
- [leetcode] 101. Symmetric Tree 解题报告
- [LeetCode]101. Symmetric Tree
- leetcode 101. Symmetric(对称的) Tree
- LeetCode 101. Symmetric Tree
- LeetCode - 101. Symmetric Tree (C++)
- leetcode-101. Symmetric Tree
- Leetcode题解 101. Symmetric Tree
- leetcode 101. Symmetric Tree
- leetcode 101. Symmetric Tree对称树(递归和迭代)
- LeetCode——101. Symmetric Tree (bfs)
- LeetCode 101. Symmetric Tree (对称树)
- [LeetCode]101. Symmetric Tree
- [leetcode] 101. Symmetric Tree