leetcode Recover Binary Search Tree
来源:互联网 发布:高中数学最优化问题 编辑:程序博客网 时间:2024/06/06 03:55
看到很多写Recover Binary Search Tree这道题的文章都用中序递归来做,我在这里告诉大家,这样做的空间复杂度也是O(n)的,所以虽然他们的答案虽然通过了,但还是没有符合题目的要求,O(1)空间复杂度遍历二叉树的一种算法是morris遍历,详见这里
以下为python的代码
基本思想为中序遍历找到两个非法节点,最后做交换
0 0
- LeetCode: Recover Binary Search Tree
- LeetCode: Recover Binary Search Tree
- [Leetcode] Recover Binary Search Tree
- [LeetCode] Recover Binary Search Tree
- [Leetcode] Recover Binary Search Tree
- [leetcode] recover binary search tree
- LeetCode -- Recover Binary Search Tree
- [LeetCode]Recover Binary Search Tree
- [LeetCode] Recover Binary Search Tree
- LeetCode:Recover Binary Search Tree
- [Leetcode]Recover Binary Search Tree
- Leetcode: Recover Binary Search Tree
- LeetCode-Recover Binary Search Tree
- [leetcode] Recover Binary Search Tree
- [LeetCode] Recover Binary Search Tree
- 【Leetcode】Recover Binary Search Tree
- Leetcode Recover Binary Search Tree
- LeetCode | Recover Binary Search Tree
- Symbolic Toolbox 表达式化简与数值转换
- Dragon之BillingServer
- OLE Automation For Richtext Format to send mail from VFP to Lotus Notes
- struts2使用json传数据的例子
- 哎,最近忙的一塌糊涂
- leetcode Recover Binary Search Tree
- 路径定向错误
- c++模板类(一)理解编译器的编译模板过程
- NS2的UDP模拟
- 符号对象(Symbolic Object)的使用
- 划分问题(dp)
- ADO初始化接口时出现“不支持此接口”错误
- javascript对象
- java四则运算