Assertion: tree's element | /r/HasProperty | accessed
Facets:
value: least once
type: TEMPORAL
value: frequently
type: DEGREE
Source sentences:
text: A splay tree is a binary search tree that automatically moves frequently accessed elements nearer to the root.
text: If every element is accessed at least once, then the cost of performing S is O