Doubly Linked Lists
Drawbacks of a circular linked list
- can’t traverse a list backwards
- can’t delete an element from a circular list given only a pointer to that node
In a DLL each node has 2 pointers, one to its
predecessor and one to its successor.
struct node{
int info;
struct node *left, *right;
};
typedef struct node *nodeptr;