426. Convert Binary Search Tree to Sorted Doubly Linked List

最新推荐文章于 2024-10-08 10:36:00 发布

ujn20161222

最新推荐文章于 2024-10-08 10:36:00 发布

阅读量150

点赞数 3

文章标签： leetcode

本文链接：https://blog.csdn.net/ujn20161222/article/details/141997891

版权

https://leetcode.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list/description/?envType=company&envId=tiktok&favoriteSlug=tiktok-three-months

"""
# Definition for a Node.
class Node:
    def __init__(self, val, left=None, right=None):
        self.val = val
        self.left = left
        self.right = right
"""

class Solution:
    def treeToDoublyList(self, root: 'Optional[Node]') -> 'Optional[Node]':
        head=None
        last=None
        def _dfs(root):
            nonlocal head, last
            if not root:return
            _dfs(root.left)
            if not head:
                head=root
            if last:
                last.right=root
                root.left=last
            last=root
            _dfs(root.right)
        _dfs(root)
        if not head:return head
        head.left=last
        last.right=head
        return head

注意这个写法维护两个指针