Pronunciations
-
/ˈʌp.tɹiː/
Adjective
Higher in a tree data structure.
Usage- not-comparable
- Antonyms
Noun
A subtree of a tree data structure that is rooted at a child of the current node (where the root node is considered to be the bottom of a tree).
- Examples
-
The principal idea of [JAF 82] is that nodes do not start to update their routing table until all nodes in uptrees are notified.
The maximum number of such left or right up-trees that we could scan is O(log N).