Let M be an ordered map with n entries implemented by means of an AVL tree. Show
Question:
Let M be an ordered map with n entries implemented by means of an AVL tree. Show how to implement the following operation on M in time O(logn+s), where s is the size of the iterator returned.
find All In Range(k1,k2): Return an iterator of all the entries in M with key k such that k1 ≤ k ≤ k2.
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Related Book For
Data Structures And Algorithms In C++
ISBN: 9780470383278
2nd Edition
Authors: Michael T. Goodrich, Roberto Tamassia, David M. Mount
Question Posted: