Skip to Main Content
Data Structures Using C, 2nd Edition by Pearson
book

Data Structures Using C, 2nd Edition by Pearson

by A. K. Sharma
May 2024
Intermediate to advanced content levelIntermediate to advanced
521 pages
14h 12m
English
Pearson India
Content preview from Data Structures Using C, 2nd Edition by Pearson
Linked Lists 231
6.3 OPERATIONS ON LINKED LISTS
The linked list is a dynamic data structure. The following operations are associated with linked
lists
:
(1) Creation of a linked list
(2) Traversing a linked list
(3) Searching in a linked list
(4) Inserting a node in a linked list
(5) Deleting a node from a linked list
6.3.1 Creation of a Linked List
From the above discussion, we know that a node of a linked list is essentially a structure because it
contains data of different types. In addition to the information part, it contains a pointer that can point
to a node, i.e., to itself or to some other node. Such structures are called self-referen ...
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

Data Structures Using C

Data Structures Using C

Samir Kumar Bandyopadhyay, Kashi Nath Dey
Intermediate C Programming, 2nd Edition

Intermediate C Programming, 2nd Edition

Yung-Hsiang Lu, George K. Thiruvathukal

Publisher Resources

ISBN: 9781299831582