Skip to Main Content
Programming and Data Structures
book

Programming and Data Structures

by Ashok Kamthane
August 2009
Intermediate to advanced content levelIntermediate to advanced
604 pages
21h 39m
English
Pearson India
Content preview from Programming and Data Structures
Linear Data Structure 513
Consider the statements
a) if (k==l) pr=first;
b) if (c==k) pr=header;
c) if (c==(k+l)) su=header;
The insertion of node can be done in between two nodes and hence the preceding and succeeding
nodes must be stored in separate pointer variables. When the user specifies 2, the entered value is
reduced by 1 and becomes 1 and is stored in variable k. When value of k is 1, the address of the first
node is stored m the pointer pr. When k is 1, the statement (b) has no reason to consider. The address
of the succeeding node is obtained by the statement (c) and the address obtained is stored in the
pointer variable su. Th
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Learning Data Structures and Algorithms

Learning Data Structures and Algorithms

Rod Stephens
Data Structures and Algorithms in C++, Second Edition

Data Structures and Algorithms in C++, Second Edition

Michael T. Goodrich, Roberto Tamassia, David M. Mount

Publisher Resources

ISBN: 9789332506343