RCS file: generic_double_linkedlist.c,v
Working file: generic_double_linkedlist.c
head: 1.15
branch:
locks: strict
access list:
symbolic names:
keyword substitution: kv
total revisions: 15;    selected revisions: 15
description:
Code to demonstrate how to implement create , insert , display and delete operations in a double linked list.
—————————-
revision 1.15
date: 2014/03/07 12:33:11;  author: root;  state: Exp;  lines: +2 -0
Status : Double linked list implementation is done successfully.
—————————-
revision 1.14
date: 2014/03/07 12:30:01;  author: root;  state: Exp;  lines: +1 -1
Syntax error fixed.
—————————-
revision 1.13
date: 2014/03/07 12:28:13;  author: root;  state: Exp;  lines: +25 -1
Implemented delete_nodes() function that will delete the entire double linked list.
Checking…
—————————-
revision 1.12
date: 2014/03/07 04:04:35;  author: root;  state: Exp;  lines: +6 -0
A check is made by printing an appropriate message in case the user chooses the display_nodes() function while there is no nodes in the double linked list.
—————————-
revision 1.11
date: 2014/03/07 04:01:33;  author: root;  state: Exp;  lines: +4 -0
Optimized the code by performing a break in the display_nodes when end->prev==NULL
Implementing the code to delete all the nodes in the double linked list.
—————————-
revision 1.10
date: 2014/03/07 03:57:33;  author: root;  state: Exp;  lines: +34 -2
display_nodes() function implemented for a double linked list.The display_nodes() function asks the user to print the nodes in the double linked list in forward order using the start pointer and it also asks the user to print the nodes in the double linked list in reverse order using the new poiner which always points to the lst node of the double linked list.
Status : display_nodes() function is implemented successfully.
—————————-
revision 1.9
date: 2014/03/07 03:17:03;  author: root;  state: Exp;  lines: +3 -3
Prototype mismatch error occured , bug fixed.
—————————-
revision 1.8
date: 2014/03/07 03:09:10;  author: root;  state: Exp;  lines: +25 -0
Gave prototypes for insert_info() and insert_node() functions.After calling the insert_node() function a node gets created and is inserted at the end of the list.
—————————-
revision 1.7
date: 2014/03/07 03:00:11;  author: root;  state: Exp;  lines: +8 -0
gave definition of the create_list() function.
Status:The start node of the double linked list is created successfully.
—————————-
revision 1.6
date: 2014/03/07 02:52:13;  author: root;  state: Exp;  lines: +1 -0
Gave prototype for create_list() function.
—————————-
revision 1.5
date: 2014/03/07 02:49:53;  author: root;  state: Exp;  lines: +18 -1
Declared two variables of type struct node and both are initialized to NULL.
Also called the create_list() function to create the start node of the double linked list.
—————————-
revision 1.4
date: 2014/03/07 02:44:08;  author: root;  state: Exp;  lines: +6 -0
A structure called node is defined with three member fields namely :
1.info part,
2.a pointer to the next node of type struct node
3.a pointer to the previous node.
—————————-
revision 1.3
date: 2014/03/07 02:42:07;  author: root;  state: Exp;  lines: +20 -0
Header file:<stdlib.h> is included to support exit() function.
—————————-
revision 1.2
date: 2014/03/07 02:36:55;  author: root;  state: Exp;  lines: +9 -0
A layout is prepared for the user that will help in selecting a specific task on a double linked list.
—————————-
revision 1.1
date: 2014/03/07 01:56:03;  author: root;  state: Exp;
Initial revision
=============================================================================