Doubly Linked Lists
•What we should have learned from these last few slides is
that
–while doubly linked lists reduce the need to manage two pointers (or use the look ahead)
–they do not necessarily improve our overall efficiency dramatically for normal deletion
–instead, they add an extra pointer required for every single node
–but they can minimize the need for traversals if used in
more complicated searches