downtree

From Wiktionary, the free dictionary
Jump to navigation Jump to search

English[edit]

Etymology[edit]

down- +‎ tree

Adjective[edit]

downtree (not comparable)

  1. (computing theory) Lower in a tree data structure.
    Antonym: uptree

Noun[edit]

downtree (plural downtrees)

  1. (computing theory) A subtree of a tree data structure that is immediately below the current node.
    • 1985, Society for Industrial, Applied Mathematics, SIAM Journal on Computing, volume 14, page 244:
      [] this data structure differs from the tree [] illustrated in Fig. 1, only by having downpointers replaced by downtrees.
    • 2006, Association for Computing Machinery, Twenty-fifth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, page 241:
      [] these ancestors represent down-trees that were removed.