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
510 Programming and Data Structures
t - >next=rear: N ow the pointer t holds the ex-last node of the linked list. The address of the new
inserted end node is assigned to the link field of node through pointer t.
rear->next=NULL: The rear pointer holds the address of the last node and its link field is assigned
a N U L L value.
Insertion of a N ode at a G iven Position
Insertion of a node can be done at a specific position in the linked list. The following figure and
program explain the insertion of a node at the specific position in the linked list. Suppose we want
to insert a node at the third position, then observe Fig. 14.21.
(a) Form ...
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