Assertion: tree's number | /r/HasProperty | proportional
Facets:
value: to the number of leaf nodes
type: OTHER
value: to the number n of items
type: OTHER
value: asymptotically
type: MANNER
Source sentences:
text: Parallel algorithms for constructing red–black trees from sorted lists of items can run in constant time or O(log log n) time, depending on the computer model, if the number of processors available is asymptotically proportional to the number n of items where n→∞.
text: Demonstrating that a leaf node is a part of a given binary hash tree requires computing a number of hashes proportional to the logarithm of the number of leaf nodes of the tree; this contrasts with hash lists, where the number is proportional to the number of leaf nodes itself.