将二维数组转换为树

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

def array_to_tree(arr):
    root = TreeNode(arr[0][0])  # 创建根节点
    build_tree(arr, root, 0, 0)  # 递归构建树
    return root

def build_tree(arr, parent, row, col):
    if row >= len(arr) or col >= len(arr[row]):
        return

    # 创建当前节点
    node = TreeNode(arr[row][col])
    parent.children.append(node)

    # 递归构建子节点
    build_tree(arr, node, row + 1, col)  # 下一行的同一列
    build_tree(arr, node, row + 1, col + 1)  # 下一行的下一列

# 示例二维数组
arr = [
    [1],
    [2, 3],
    [4, 5, 6],
    [7, 8, 9, 10]
]

# 转换为树
tree = array_to_tree(arr)

# 打印树的结构
def print_tree(node, level=0):
    if node is None:
        return
    print(' ' * level + str(node.value))
    for child in node.children:
        print_tree(child, level + 1)

print_tree(tree)

1
  2
    4
      7
    5
      8
  3
    5
      8
    6
      9
      10