使用python中的矩阵(数组)生成带有递归的树节点(无二进制

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

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

def generate_tree(matrix):
    if not matrix:
        return None
    
    root = TreeNode(matrix[0])
    
    for i in range(1, len(matrix)):
        child = generate_tree(matrix[i])
        root.children.append(child)
    
    return root

# 示例用法
matrix = [[1], [2, 3], [4, 5, 6]]
tree = generate_tree(matrix)