如何将值存储在列表中，同时在树中进行顺序遍历？

# 定义二叉树节点
class TreeNode:
    def __init__(self, val):
        self.val = val
        self.left = None
        self.right = None

# 将值存储在列表中
values = [5, 3, 8, 2, 4, 7, 9, 1, 6]

# 创建二叉树并插入值
root = None
for val in values:
    if root is None:
        root = TreeNode(val)
    else:
        current = root
        while True:
            if val < current.val:
                if current.left is None:
                    current.left = TreeNode(val)
                    break
                else:
                    current = current.left
            else:
                if current.right is None:
                    current.right = TreeNode(val)
                    break
                else:
                    current = current.right

# 顺序遍历二叉树
def inorder_traversal(node):
    if node is not None:
        inorder_traversal(node.left)
        print(node.val)
        inorder_traversal(node.right)

inorder_traversal(root)