输入是一个多叉树节点的数组和长度,要求打印出每一个节点的总权

#include <unordered_map>
#include <iterator>
#include <stdexcept>
#include <set>
#include <iostream>
using namespace std;

typedef struct {
	size_t id;
	size_t parentId;
	size_t weight;
} Node;

void print_weight_of_tree(Node array[], size_t len)
{
	if (len == 0) {
		return;
	}

	unordered_map<size_t, size_t> id_index;
	id_index.rehash(2 * len);
	for(size_t i = 0; i != len; i++) {
		id_index.emplace(array[i].id, i);
	}

	int *state = new int [len]();
	size_t *weight = new size_t [len];
	for(size_t i = 0; i != len; i++) {
		weight[i] = array[i].weight;
		//root node
		if(array[i].id == array[i].parentId)
			continue;
		auto it = id_index.find(array[i].parentId);
		if(it == id_index.end()) {
			throw logic_error("parent not Found");
		}
		//tag
		state[it->second] = 1;
	}
	bool end = false;
	set<size_t> new_leaf_index;
	while(!end) {
		for(auto leaf_index : new_leaf_index) {
			state[leaf_index] = 0;
		}
		new_leaf_index.clear();
		for(size_t i = 0; i != len; i++) {
			if(state[i] == 0) {
				size_t parent = array[i].parentId;
				//root node
				if(parent == array[i].id) {
					state[i] = -1;
					end = true;
					break;
				} else {
					size_t parent_index = id_index.find(parent)->second;
					new_leaf_index.insert(parent_index);
					weight[parent_index] += weight[i];
					state[i] = -1;
				}
			}
		}
	}

	for(size_t i = 0; i < len; i++) {
		cout << "id: " << array[i].id << " weight: " << weight[i] << endl;
	}
	delete [] state;
	delete [] weight;
}

int main()
{
	size_t len;
	cin >> len;
	Node *array = new Node[len];
	for(size_t i = 0; i != len; i++) {
		cin >> array[i].id >> array[i].parentId >> array[i].weight;
	}
	print_weight_of_tree(array, len);
        delete [] array;
	return 0;
}

多叉树有几个叉？

struct TreeNode

{

int weight；

int parentid；

vector<int> childid;