AsukaMinato

AsukaMinato

HomeArchives

tree

897. Increasing Order Search Tree 倒着中序遍历 + 生成器
中序遍历不一定需要左中右。 这种解法也不需要 queue 来存，用 stream, 一切都很自然。 Copy class Solution: def increasingBST(self, root: TreeNode) -> TreeNode: def…
leetcode
Ownership of this blog data is guaranteed by blockchain and smart contracts to the creator alone.