Comparision between BST, Array, LinkedList, Hashtable

BST:

BST has the advantages of both array and linked list: it can do binary search and also it is of dynamic size.

BST allows fast enumeration of the items in key order.

  Lookup algorithms get more complicated when there may be multiple items with the same key.

support range query

 

Hashtable:

lookup operation in hashtable is constant.

cannot provide ordering

do not support range query 

 

Array:

allow random access

change is hard: need to change the whole structure

LinkedList:

allow easy insertion, extension, resize.

do not support random access

change is easy: just change the pointer