用于实现表示树的父(子)子关系的矩阵的Python程序

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

def build_adjacency_matrix(root):
    nodes = list(reversed(postorder_traversal(root)))  # 使用后序遍历获取节点顺序
    n = len(nodes)
    adjacency_matrix = [[0] * n for _ in range(n)]
    
    node_index_map = {node: index for index, node in enumerate(nodes)}
    
    for node in nodes:
        parent_index = node_index_map.get(node.parent)
        if parent_index is not None:
            adjacency_matrix[parent_index][node_index_map[node]] = 1
    
    return adjacency_matrix

def postorder_traversal(root):
    if root is None:
        return []
    result = []
    for child in root.children:
        result.extend(postorder_traversal(child))
    result.append(root)
    return result

# 示例使用
root = TreeNode('A')
B = TreeNode('B')
C = TreeNode('C')
D = TreeNode('D')
E = TreeNode('E')

root.children = [B, C]
B.parent = root
C.parent = root
B.children = [D, E]
D.parent = B
E.parent = B

adj_matrix = build_adjacency_matrix(root)
for row in adj_matrix:
    print(row)