Summary of content after midterm

AVL tree
self adjust to re-balance after insertion
insert remove node from AVL tree
Heap
mapping from binary tree to an array
priority queue
heapsort
Hash
hash function
type of organisation
    divide into bin, use linked list
    hash table
collision resolution
    linear probing
    quadratic probing
    rehash
Sorting
O(n^2)
    shell sort
      special case: bubble sort
    insertion sort
    selection sort
O(n log n)
    merge sort
    quick sort
    heap sort
analysis (informal) of sorting

Good luck in your final exam !