About this document
Augmenting Data Structures Overview by Jhon is a document available to read on EtoBox.
The document discusses augmenting binary search trees with additional information to support new operations like selecting the element with a given rank, describing how red-black trees can be augmented by storing the rank of each node to enable rank selection in O(log n) time, but that this approach requires recomputing all ranks on insertions in worst case O(n) time. It then introduces a better solution of storing partial rank information to allow rank selection and updates in O(log n) time.
- Author
- Jhon
- Language
- EN