题目如上,解法于我而言如天光,记录之
def increasingBST(self, root: TreeNode) -> TreeNode:
s = []
dummy = TreeNode(0)
p = dummy
while s or root:
if root:
s.append(root)
root = root.left
else:
cur = s.pop()
# 记录子树的右节点,保存之,使得下次访问时将其加入
root = cur.right
cur.left = None
# 让指针移动到下一位
p.right = cur
p = p.right
return dummy.right
感谢leetcode的前辈们留下评论