display(method display(methodhigharray class displayforward(methoddoubly linked list displaylist(methoditerators edges displaynode(method adding displayperson(method minimum spanning trees displaystack(method minimum spanning trees for weighted graphs displayword(method distpar class divide-and-conquer approach doanagram(method doparse(method dotrans(method dot operator ) double-ended lists - double data typeinput double hashing hashdouble applet java code doubly linked lists - deletion - - deques insertion - traversal doublylinked java - duplicate keys binary trees red-black trees duplicates arrays deletion - insertion searching open addressing priority queuesminimum spanning trees for weighted graphs paths weighted graphs efficiencyweighted graphs equality operator (==) equations bubble sort insert sort logarithms - error handlingstacks eulerleonardgraphs exceptionsarray index out of bounds experimentstrees explicit pointers extended classes external hashing external storage -trees efficiency - insertion - one block per node searching choosing -trees hashing indexed files sequential virtual memory external data separate chaining one block at time versus no duplicates slow access