In doubly linked list, the navigation happens in both the ways, forward and backwards.
In Doubly Linked list each link carries a data field and two link fields called next and prev.
Basic Operations are
1. Insertion(Add element at beginning)
2. Deletion(Delete element at beginning)
3. Insert Last(Add element at end)
4. Delete Last(Delete element at end)
5. Insert After(Insert after an element)
6. Delete(Delete after an element)
7. Display forward(Displays list in forward manner)
8. Display backward(Displays list in backward manner)
Basic Operations are
1. Insertion(Add element at beginning)
2. Deletion(Delete element at beginning)
3. Insert Last(Add element at end)
4. Delete Last(Delete element at end)
5. Insert After(Insert after an element)
6. Delete(Delete after an element)
7. Display forward(Displays list in forward manner)
8. Display backward(Displays list in backward manner)
No comments:
Post a Comment