links delete(method data records data storage data structures find(method nodes red-black trees characteristics with no children general purpose with one child - arrays with two children - balanced trees priorityq workshop applet big notation separate chaining binary search trees hash tables vertices delimiter matching - - libraries brackets java - linked lists opening delimiters - speed - special purpose depth-first search - dfs java big notation graphn applet priority queues java code - queues stacks deques doubly linked lists data typesadts derived classes databases - descending-priority queue dataitem class destination vertices del button development systems rbtree workshop delete(method dfs(method dfs java higharray class dictionaryhashing - linear probing dijkstra' algorithm links key points deleting directed graphs array data - duplicate keys - example (array java) doubly linked lists linklist workshop applet connectivity in - topological sorting - cycles/trees graphd applet - disk drives -treesinsertion reading how can we make this index more usefulemail us at indexes@samspublishing com