Doubly Linked Lists
	• We have already discussed – the benefits and drawbacks of doubly linked lists in relation to various “position oriented” ADTs – avoids the need to manage a previous pointer when we traverse – think about this: when you traverse a singly linked list to remove a node -- what happens? – yes! two pointers must be managed (current, previous) or a look-ahead approach is used which requires 2 dereferences!