I was being asked a Qn in an interview to sort :
Array, LinkedList, Hashtable, BinaryTree
based on how quickly can u you access an element from them.
I found this question difficult to answer since I feel:
Hashtable and Array have constant access time.
Binary tree depends on how you implement them (AVL tree, Splay tree etc..).
Linkedlist depends on where the element is..
so how can one sort them!!