separate chaining insert employee numbers (keys) external remove heapsort external storage - efficiency open addressing recursion double hashing - heapsort java linear probing - - higharray class quadratic probing higharray java separate chaining hoarec hashchain applet - holes java code horner' method heap java huffman code - arrayexpanding array size insertion - key change listing implementation removal - - trees - heapify(method priorityq workshop applet heaps queues - expansion red-black trees insertion - increments java code incrementsize(method array expansion indexed fileschoosing array size indexes insertion - arrays key change hash tables removal - indexing (external storage) priority queues file in memory removal multiple swapped - searching tree-based - too large weakly ordered induction workshop applet infix notation change binary trees fill translating to postfix - - how can we make this index more usefulemail us at indexes@samspublishing com