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
500 Programming and Data Structures
2) rear - >next=node;
The rear pointer keeps track of the last node, the address of current node (node) is assigned to link
field of the previous node.
3) rear=node;
Before creating the next node, the address of the last created node is assigned to pointer rear, which
is used for statement (2). In function main (), using while loop the elements of the linked list are
displayed.
Header: The pointer header is very useful in the formation of a linked list. The address of first
node (1888) is stored in the pointer header. The value of the header remains unchanged until
it turns out to be NULL. The st
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