Download as PDF, PPTX
Uploaded byjyoti_lakhani
PDF, PPTX68 views
Doubly linked list
A doubly linked list is a type of linked list that allows navigation in both directions via previous and next pointers. It supports insertion and deletion at both the front and rear of the list. The document outlines the process for inserting and deleting nodes from a doubly linked list, including handling empty and non-empty list cases.
More Related Content
More from jyoti_lakhani
Doubly linked list
- 1. DOUBLY LINKED LIST AType of Linked List in which navigation is possible in both directions, -from FRONT to REAR and -from REAR to FRONT 13 11 12 Start 13 NULL A NODE in a DLL DOUBLY LINKED LIST (DLL) Previous Pointer Next Pointer
- 2. DOUBLY LINKED LIST Insertionat FRONT CASE 1: List Empty CASE 2: List is Non Empty 13 11 12 Start NN Temp 3 4 13 11 12 Start NN 1 Temp 2 Start NN Start NN
- 3. DOUBLY LINKED LIST Insertionat END CASE 1: List Empty CASE 2: List is Non Empty 13 11 12 Start PTR 1 PTR 2 4 Start NN Start NN NN 3
- 4. DOUBLY LINKED LIST Deletefrom FRONT CASE 1: List Empty CASE 2: List is Not Empty 13 11 12 Start PTR 2 3 4 13 11 12 Start PTR 1 Start Message (“No node available to Delete”)
- 5. DOUBLY LINKED LIST Deletefrom REAR CASE 1: List Empty CASE 2: List is Non-Empty 13 11 12 Start PTR 1 PTR 2 3 13 Temp 4 13 11 12 Start PTR 1 PTR 2 3 13 Temp Start Message (“No node available to Delete”)