Question: Show, by adding pointers to the nodes, how to support each of the dynamic-set queries MINIMUM, MAXIMUM, SUCCESSOR, and PREDECESSOR in O(1) worst case time
Show, by adding pointers to the nodes, how to support each of the dynamic-set queries MINIMUM, MAXIMUM, SUCCESSOR, and PREDECESSOR in O(1) worst case time on an augmented order-statistic tree. The asymptotic performance of other operations on order-statistic trees should not be affected.
Step by Step Solution
3.36 Rating (162 Votes )
There are 3 Steps involved in it
MINIMUM A pointer points to the minimum node if the node i... View full answer
Get step-by-step solutions from verified subject matter experts
