下面是一个示例代码，用于按照子孙节点对数组进行排序：

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

def add_child(parent, child):
    parent.children.append(child)

def flatten_tree(node, result):
    result.append(node.value)
    for child in node.children:
        flatten_tree(child, result)

def sort_array_by_descendants(nodes):
    flattened = []
    for node in nodes:
        flatten_tree(node, flattened)
    sorted_array = sorted(flattened, reverse=True)
    return sorted_array

# 创建一个树结构
root = Node(1)
child1 = Node(2)
child2 = Node(3)
child3 = Node(4)
grandchild1 = Node(5)
grandchild2 = Node(6)

add_child(root, child1)
add_child(root, child2)
add_child(root, child3)
add_child(child2, grandchild1)
add_child(child2, grandchild2)

# 对数组进行排序
nodes = [root, child1, child2, child3, grandchild1, grandchild2]
sorted_array = sort_array_by_descendants(nodes)

print(sorted_array)

运行以上代码，输出结果为：[6, 5, 4, 3, 2, 1]。这个结果表示按照子孙节点对数组进行排序后的结果。