How can I convert sorted doubly linked list to balance binary search tree?

Question

\'\'\'

def convertoDBL(root):
    head = None
    prev = None
    def helper(root):
        nonlocal head, prev
        if root is None:
            return