avltree/AVLTree.py
def recurse(root) -> None:
            """standard inorder traversal of binary tree

            Args:
                root (AVLNode): the root of the tree
            """
            nonlocal out
            if not root:
                return

            recurse(root.left)
            key = root.get_key()
            value = root.get_value()
            out.append([key, value])
            recurse(root.right)
standard inorder traversal of binary tree

            Args:
                root (AVLNode): the root of the tree
            
standard inorder traversal of binary tree
standard inorder traversal of binary tree
def recurse(root) -> None:
            nonlocal out
            if not root:
                return
            recurse(root.left)
            key = root.get_key()
            value = root.get_value()
            out.append([key, value])
            recurse(root.right)
def recurse ( root ) -> None : nonlocal out if not root : return recurse ( root . left ) key = root . get_key ( ) value = root . get_value ( ) out . append ( [ key , value ] ) recurse ( root . right )
standard inorder traversal of binary tree
standard inorder traversal of binary tree
"""standard inorder traversal of binary tree

            Args:
                root (AVLNode): the root of the tree
            """
root
the root of the tree
the root of the tree