Tuesday, September 4, 2018

[LeetCode]Increasing Order Search Tree

递归的题目,每次找当前子树最小的节点,删除最小节点,然后作为根,继续递归剩下的树即可。时间复杂度O(n),代码如下:


No comments:

Post a Comment