[C++]

Consider an ADT dictionary which stores a playlist catalogue of songs. Each song has a singer, a title, and other information about the song.

you want to support two search operations -- getItemBySinger, and getItemByTitle

propose an efficient implementation for an ADT dictionary where both operations are average case O(log n)