trees tree workshop applet fill button find button partition - efficiency - stopping/swapping - ins button quicksort - zoom button - recursion tree java recursive (towers of hanoi) stable all-pairs shortest-path problemweighted graphs - anagram java abstract data type abstraction adts class interfaces access modifiers accessingarray elements addedge(method adjacency (graphs) adjacency list adjacency matrix directed graphs adjust_spath(method adts (abstract data types) abstraction data types design tool interfaces lists queue implementation - stack implementation algorithms big notation depth-first search (graphs) dijkstra' intractable problems - minimum spanning trees for weighted graphs anagrams - applets bubble sort workshop draw button new button run button size button step button graphd workshop - graphdw workshop - graphn workshop bfs dfs minimum spanning trees graphw workshop - hash workshop - hashchain workshop buckets deletion duplicates load factors table size hashdouble workshop - heap workshop change fill