07-14-2014 05:58 PM
I have a tree with the root node at the top. Each node value is a vector of length 100k.
The goal is to find values of all nodes especially the parent nodes. The input
are the leaf node vectors: if there are ten leaves, then there will be ten
vectors of length 100k, or a 100k by 10 matrix . The output will be all the
aggregated vectors: the value of any parent is the sum of all its children and
the value of the leaf is simply the input. If there are 30 nodes in the tree,
the output will be a 100k –by- 30 matrix with each column representing a node. Does anyone know a data structure and
algorithm to do this efficiently? The tree can be any given tree. Thanks.