downtree
/ˈdaʊn.tɹiː/
adj 1noun 1
Definitions
adj
1
Lower in a tree data structure.
noun
1
A subtree of a tree data structure that is immediately below (closer to the tree root) the current node.
[…] this data structure differs from the tree […] illustrated in Fig. 1, only by having downpointers replaced by downtrees.
[…] these ancestors represent down-trees that were removed.
Your note
not saved0 chars