EmbLogic's Blog

different operation on link list

operation on link list which i’ve performed:
1.creation of link list,
2.insertion of node
a.at begining,
b.at end,
c.at any position
d.at any key value(if a certain element is present then insert this node)
3.traverse on link list
4.searching of any element
5.deletion of node
a.deletion of first most node
b.at end
c.at any position
d.at key value(deletion of a particular element)
————————
RCS file: llist_ato_sir.c,v
Working file: llist_ato_sir.c
head: 1.24
branch:
locks: strict
access list:
symbolic names:
keyword substitution: kv
total revisions: 24; selected revisions: 24
description:
created the main menu
accroding to main menu ,i’ve made a choice function
which has the function call of all choices
—————————-
revision 1.24
date: 2014/07/11 08:49:37; author: root; state: Exp; lines: +1 -1
resolve error
—————————-
revision 1.23
date: 2014/07/11 08:47:33; author: root; state: Exp; lines: +8 -1
correct the problem of insert_node_pos()
keeping the entered node position less than total node
—————————-
revision 1.22
date: 2014/07/11 08:42:15; author: root; state: Exp; lines: +1 -1
resolve the error
—————————-
revision 1.21
date: 2014/07/11 08:40:54; author: root; state: Exp; lines: +1 -1
give the argument to search_element function
base address is argument
—————————-
revision 1.20
date: 2014/07/11 08:39:55; author: root; state: Exp; lines: +25 -7
define the search_element function
—————————-
revision 1.19
date: 2014/07/11 08:25:22; author: root; state: Exp; lines: +15 -3
make the delete_key for compatible for first node
for doing this i’ve used if else condition
—————————-
revision 1.18
date: 2014/07/11 08:03:10; author: root; state: Exp; lines: +13 -7
resolve the problem of delete_key()
—————————-
revision 1.17
date: 2014/07/11 07:50:06; author: root; state: Exp; lines: +20 -0
giving definition to delete_key function
this function take the value
if that value is present in any node
then that node will deleted
—————————-
revision 1.16
date: 2014/07/11 05:01:09; author: root; state: Exp; lines: +1 -1
*** empty log message ***
—————————-
revision 1.15
date: 2014/07/11 04:57:52; author: root; state: Exp; lines: +8 -5
given definition of delete_at_beg()
—————————-
revision 1.14
date: 2014/07/11 04:51:50; author: root; state: Exp; lines: +4 -3
correct the error in function delete_nod_pos()
for position 2
—————————-
revision 1.13
date: 2014/07/11 04:46:39; author: root; state: Exp; lines: +38 -0
definr delete_at_pos() function
—————————-
revision 1.12
date: 2014/07/11 04:14:35; author: root; state: Exp; lines: +8 -6
*** empty log message ***
—————————-
revision 1.11
date: 2014/07/11 03:57:36; author: root; state: Exp; lines: +2 -3
modify the delete_node()
—————————-
revision 1.10
date: 2014/07/11 03:54:17; author: root; state: Exp; lines: +55 -13
making function for delete operation
define delete_node()
then defined delete_at_end() only for now
—————————-
revision 1.9
date: 2014/07/11 03:25:22; author: root; state: Exp; lines: +3 -2
puting the header file in header.h
—————————-
revision 1.8
date: 2014/07/11 01:44:38; author: root; state: Exp; lines: +25 -12
created inser at key value function
this function insert node when the key value(if a certain value is present)
then it will insert a node
—————————-
revision 1.7
date: 2014/07/10 14:12:57; author: root; state: Exp; lines: +43 -20
creating insertion at key value
—————————-
revision 1.6
date: 2014/07/10 10:07:09; author: root; state: Exp; lines: +94 -6
*** empty log message ***
—————————-
revision 1.5
date: 2014/07/10 03:08:51; author: root; state: Exp; lines: +6 -1
*** empty log message ***
—————————-
revision 1.4
date: 2014/07/10 02:27:34; author: root; state: Exp; lines: +51 -5
created the insert node function
in which we can insert node at beg,at end and at any position
but for now i’ve only made insertion of node at end
—————————-
revision 1.3
date: 2014/07/10 01:57:31; author: root; state: Exp; lines: +28 -8
making the traverse function
—————————-
revision 1.2
date: 2014/07/10 01:41:22; author: root; state: Exp; lines: +13 -1
created the link list function
—————————-
revision 1.1
date: 2014/07/10 01:27:12; author: root; state: Exp;
Initial revision
=============================================================================
———-header.h file—————
RCS file: ./header.h,v
Working file: header.h
head: 1.6
branch:
locks: strict
access list:
symbolic names:
keyword substitution: kv
total revisions: 6; selected revisions: 6
description:
created header in which declare all the header file and the
function prototype
—————————-
revision 1.6
date: 2014/07/11 08:39:30; author: root; state: Exp; lines: +1 -1
declare the prototype of search_element function
—————————-
revision 1.5
date: 2014/07/11 08:24:50; author: root; state: Exp; lines: +1 -1
change the return type of delete_key();
—————————-
revision 1.4
date: 2014/07/11 05:00:28; author: root; state: Exp; lines: +1 -1
modify the prototype of delete_node_at_beg()
—————————-
revision 1.3
date: 2014/07/11 04:13:43; author: root; state: Exp; lines: +1 -1
correct the declaration of delete_key()
—————————-
revision 1.2
date: 2014/07/11 03:51:55; author: root; state: Exp; lines: +4 -0
decleared the prototype of delete_node
in reference to delete the is also four delete position declearation
—————————-
revision 1.1
date: 2014/07/11 03:25:22; author: root; state: Exp;
Initial revision
=============================================================================

Leave a Reply

Your email address will not be published. Required fields are marked *

You may use these HTML tags and attributes: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <strike> <strong>