Data structure fundamentals: arrays, linked lists, hash tables and trees

Answer quick fundamentals questions: the time complexity of common sorting algorithms; arrays versus linked lists, including the cost of inserting at the head and in the middle and what an array does step by step when you insert at the front; what a hash table is and how it is built; and the difference between a binary tree and a binary search tree.