如何迭代列表和构建树

my_list = [1, 2, 3, 4, 5]
for item in my_list:
    # 对每个元素进行操作或处理
    print(item)

def iterate_list(my_list):
    if len(my_list) == 0:
        return
    else:
        # 对当前元素进行操作或处理
        print(my_list[0])
        # 递归调用处理剩余的子列表
        iterate_list(my_list[1:])

my_list = [1, 2, 3, 4, 5]
iterate_list(my_list)

class TreeNode:
    def __init__(self, value):
        self.value = value
        self.children = []

def build_tree(data):
    if not data:
        return None
    root = TreeNode(data[0])
    for child_data in data[1:]:
        child_node = build_tree(child_data)
        root.children.append(child_node)
    return root

data = [1, [2, [4, 5], 3]]
tree = build_tree(data)

class TreeNode:
    def __init__(self, value):
        self.value = value
        self.children = []

def build_tree(data):
    if not data:
        return None
    root = TreeNode(data[0])
    stack = [root]
    for child_data in data[1:]:
        child_node = TreeNode(child_data)
        stack[-1].children.append(child_node)
        stack.append(child_node)
    return root

data = [1, [2, [4, 5], 3]]
tree = build_tree(data)