DOUBLY
LINKED LIST – LINKED LIST IMPLEMENTATION
Aim:
To
write a program to implement doubly linked list using linked list.
Algorithm:
Step
1: Declare header and pointer variables
Step
2: Display the choices
Step
3: If choice is 1 the get the element to be inserted in beginning and call
ins_beg function.
Step
4: If choice is 2 the get the element to be inserted in the end and call the
ins_end function
Step
5: If choice is 3 then get the element to be deleted and call deletion
function.
Step
6: If choice is 4 then call display duncation
Step
7: If choice is default the exit the program
Step
8: Terminate the program execution.
Program:
