Assertion: b tree | /r/CapableOf | allow sequential access
Facets:
value: in logarithmic time
type: TEMPORAL
Source sentences:
text: In computer science, a B-tree is a self-balancing tree data structure that maintains sorted data and allows searches, sequential access, insertions, and deletions in logarithmic time.