Unformatted text preview: 4. (5 marks) Assume you have a. tree T holding n elements. Describe how you can ﬁnd themlogu umaﬂgwmmtinw in 0(nlog(logngl. Be sure to explain why your
method is'iirithin this time bound. (Don t worry 8 ut calculating the value of log u;
just assume you have a method to return the closest integer to logn in constant time.) Use any additional data structures you may need. ...
View Full Document
- Winter '10
- Computer Science