Jump to content

Tree accumulation

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by GrEp (talk | contribs) at 20:34, 2 November 2012 (Initial article, need to add in encyclopedic applications for n-body problems, string computations, ... add a picture example). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

In Computer Science, tree accumulation is the process of accumulating data placed in tree nodes according to their tree structure. Formally this operation is a catamorphism.

Upward accumulation refers to accumulating on each node information about all decedents. Downward accumulation refers to accumulating on each node information of every ancestor.

Gibbons, Jeremy (1991). Algebras for Tree Algorithms (PDF) (Ph.D.). Oxford University.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Tree_accumulation&oldid=521105876"