Root of AVL Tree

def solve(____):
    nums = list(map(int, str(____).split(____)))
    class Node:
        def __init__(____):
            self.val = val
            self.left = None
            self.right = None
            self.height = ____
    def height(____):
        return node.height if node else ____
    def update(____):
        node.height = max(height(____), height(____)) + ____
    def rotate_right(____):
        x = y.left
        y.left = x.right
        x.right = y
        update(____)
        update(____)
        return x
    def rotate_left(____):
        y = x.right
        x.right = y.left
        y.left = x
        update(____)
        update(____)
        return y
    def insert(____):
        if not node:
            return Node(____)
        if val < node.val:
            node.left = insert(____)
        else:
            node.right = insert(____)
        update(____)
        b = height(____) - height(____)
        if b > ____:
            if val > node.left.val:
                node.left = rotate_left(____)
            return rotate_right(____)
        if b < -____:
            if val < node.right.val:
                node.right = rotate_right(____)
            return rotate_left(____)
        return node
    root = None
    for v in nums:
        root = insert(____)
    print(____)