{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

5 - 4(5 marks Assume you have a tree T holding n elements...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 4. (5 marks) Assume you have a. tree T holding n elements. Describe how you can find themlogu umaflgwmmtinw 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

{[ snackBarMessage ]}