Worst case complexity of searching a node in Single Linked list is Worst case complexity of searching a node in a binary search tree is Worst case complexity of searching a node in an AVL tree is Average complexity of searching a node in a Hash table is expected to be BST is best for integer arrays only, as it can compare only integers Hash tables are best for searching for items in a certain range [e.g. search for ages between 20-30] Heap is best for accessing items in a given range [e.g. ages between 20-30] After construction, a maximum Heap can access the maximum of a list of items in After construction, a maximum Heap can remove the maximum of a list of items in A sorted array can be searched faster