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 times 30 matrix. Does anyone know a data structure and algorithm to do this efficiently? If I would like to do this by SAS/IML, it there a way to do it? The tree can be any given tree. Thanks.
At this moment, I don't need to add/delete or prune branches. Maybe in future I need. At present, assume that I have a fixed tree which is already constructed, we just need to aggregate tree at each height of tree only. I tried to upload a tree picture, but I failed.
Time is running out to save with the early bird rate. Register by Friday, March 1 for just $695 - $100 off the standard rate.
Check out the agenda and get ready for a jam-packed event featuring workshops, super demos, breakout sessions, roundtables, inspiring keynotes and incredible networking events.
Learn how to run multiple linear regression models with and without interactions, presented by SAS user Alex Chaplin.
Find more tutorials on the SAS Users YouTube channel.