Not really sure about the index data structure. I thought only array or hashtable can give the direct index to access. Still don't know why tree can give the same kind of indexing as hashtable.
Sigiloso
Binary Search Tree, you can setup index in the BST, and index can be used to match the bigger result. But going to take nlogn to access data.