接受一个整数列表作为输入，并将它们一个接一个地插入到python中的一个空的二进制搜索树中

class TreeNode:
    def __init__(self, val):
        self.val = val
        self.left = None
        self.right = None
        
def insertNode(root, val):
    if not root:
        return TreeNode(val)
    if val < root.val:
        root.left = insertNode(root.left, val)
    else:
        root.right = insertNode(root.right, val)
    return root

def inorderTraversal(root):
    if root:
        inorderTraversal(root.left)
        print(root.val)
        inorderTraversal(root.right)

def main():
    nums = [5, 3, 7, 2, 4, 6, 8]
    root = None
    for num in nums:
        root = insertNode(root, num)
    inorderTraversal(root)

if __name__ == "__main__":
    main()

2
3
4
5
6
7
8