Link List Programming Linked List in Cpp

Feb 12, 2025Download as PPTX, PDF

0 likes8 views

The document defines a linked list class in C++ with several methods including adding, deleting, displaying, counting, and searching nodes. Key functions include 'addatbeg' to add a node at the beginning and 'addafter' to insert at a specified position. The main function presents a menu-driven interface to interact with the linked list functionalities.

Programming Linked List
class LinkedList{
// declaration of the node
struct node{
int info;
node *next;
};
//private variable declared
node *start;
public:
LinkedList() //
Constructor
{
start = NULL;
}
//public fucntion declared
void AddAtBeg(int);
void AddAfter(int, int);
void Delete();
void Count();
void Search(int);
void Display();
};
20

Programming Linked List
// following function will add new element at the beginning
// also used to create first node
void LinkedList::AddAtBeg(int data)
{
node * newNode;
newNode = new node;
newNode->info = data;
newNode->next = start;
start = newNode;
}/*End of addatbeg()*/
21

Programming Linked List
//This function will add new element at any position
void LinkedList::AddAfter(int data, int pos)
{ node *newNode, *q;
q = start;
if(q == NULL) {
cout<<"nnEmpty linked list" << endl;
return;
}
//Finding the position in the linked list to insert
for(int i = 1; i < pos; i++)
q = q->next;
newNode = new node;
newNode->info = data;
newNode->next = q->next;
q->next = newNode;
}
22

Programming Linked List
void LinkedList::Delete()
{
node *tmp, *ptr;
int data;
if(start == NULL)
{
cout<<"nn List is empty"<<endl;
return;
}
cout<<"nnEnter the element for deletion : ";
cin>>data; // delete first node
if(start->info == data)
{ tmp = start;
start = start->next;
delete(tmp);
return;
}
23

ptr = start;
while(ptr->info != data) {
temp = ptr;
ptr = ptr ->next;
}
tmp->next = ptr->next;
delete(ptr); // Delete node in between, or last
node
}/*End of del()*/
24

Programming Linked List
void LinkedList::Display()
{
// Fill in the code that displays the contents of the linked list
} /*End of display() */
void LinkedList::Count()
{
// Fill in the code
that counts the
nodes of the linked
list
} /*End of count() */
void LinkedList::Search(int data)
{
// Fill in the code that will find the position of a node that
holds the ‘data’
} 25

Programming Linked List
int main()
{
int choice, n, m, position, i;
LinkedList po;
while(1)
{
cout<<"1. Add at beginningn";
cout<<"2. Add after n";
cout<<"3. Deleten";
cout<<"4. Displayn";
cout<<"5. Countn";
26

Programming Linked List
cout<<"6. Searchn"
cout<<"7. Quitn";
cout<<"n Enter your choice:";
cin>> choice;
switch(choice) {
case 1:
cout<<"nnEnter the element:";
cin>>m;
po.AddAtBeg(m);
break;
27

Programming Linked List
case 2:
cout<<"nnEnter the element:";
cin>>m;
cout<<"nPosition after inserted element:";
cin>>position;
po.AddAfter(m,position);
break;
case 3: po.Delete();
break;
case 4: po.Display();
break;
case 5: po.Count();
break;
case 6: cout<<"n
nEnter the element
to search:"; 28

Programming Linked List
cin>>m;
po.Search(m);
break;
case 7:
exit(0);
default:
c
out<<"
n
nWron
g
choice
";
}/*End of
switch */
29

This document discusses linked lists and their implementation. It begins by defining a list as a sequence of zero or more elements of a given type that can be linearly ordered. Linked lists are introduced as a flexible data structure that uses nodes connected by pointers to dynamically allocate elements in memory. The key operations on linked lists are described, including appending, traversing, inserting, deleting nodes. Code examples are provided to implement these operations using a ListNode struct containing a data element and pointer to the next node. Functions like appendNode and displayList are demonstrated, with appendNode adding to the end of the list and displayList traversing the list to output each element.

Linked lists aKhuram Shahzad

The document provides an overview of linked lists, defining them as collections of nodes where each node contains data and a pointer to the next node. It discusses various types of linked lists, operations (such as insertion and deletion), and compares linked lists with arrays in terms of memory management and functionality. Key terminologies and basic operations necessary for implementing linked lists are also outlined.

Lecture3Muhammad Zubair

This document discusses linked lists and office hours for assistance with the linked lists lecture and course assignments. Key points: - Office hours are Tuesday and Friday from 2:30-4:00pm, where assignments must be submitted and queries answered. Students should follow office hours strictly. - A linked list is a data structure where each item contains the address of the next item, unlike arrays which have a fixed size. Linked lists can dynamically increase in size as needed. - The document discusses creating linked list nodes with an item field and pointer to the next node, and chaining the nodes together by modifying the pointers.

Lecture3Muhammad Zubair

Create a link list. Add some nodes to it, search and delete nodes fro.pdfhadpadrrajeshh

DS_LinkedList.pptxmsohail37

The document discusses linked lists and their basic operations. It defines a linked list as a series of connected nodes where each node contains a data element and a pointer to the next node. The basic operations of linked lists include inserting nodes, finding or deleting nodes by value, and traversing the list. It also discusses different types of linked lists like singly linked lists, doubly linked lists, and circular linked lists. The document explains how to implement operations like insertion, deletion, and traversal in detail with examples.

data structures Linked List concept.pptxlavanyaa88

dynamicList.pptssuser0be977

The document discusses implementing a sorted linked list data structure in C++. It describes how to insert a new node into the linked list in the correct sorted position by finding the previous and current nodes between which the new node should be inserted. The key steps are to create a new node, find the previous and current nodes using a while loop, and connect the new node by updating the next pointers of the previous and current nodes.

9781285852744 ppt ch17Terry Yoast

This document provides an overview of linked lists. It discusses the basic properties of linked lists, including how they are composed of nodes that contain data and a pointer to the next node. It describes common linked list operations like traversal, insertion, and deletion. It also covers different types of linked lists, such as singly linked lists, doubly linked lists, ordered vs unordered lists, and how to implement linked lists as an abstract data type in C++.

Unit ii(dsc++)Durga Devi

This document discusses different types of linked lists including singly linked lists, circular linked lists, and doubly linked lists. It provides details on representing stacks and queues using linked lists. Key advantages of linked lists over arrays are that linked lists can dynamically grow in size as needed, elements can be inserted and deleted without shifting other elements, and there is no memory wastage. Operations like insertion, deletion, traversal, and searching are described for singly linked lists along with sample C code to implement a linked list, stack, and queue.

lecture four of data structures :Linked List-ds.pptdonemoremaregere376

Linked List.pptxPoonamPatil120

This document discusses linked lists and their implementation in C/C++. It begins with the objectives of understanding linked lists as a dynamic data structure that can grow and shrink. It then covers memory allocation and the differences between static and dynamic memory allocation. Key concepts discussed include using malloc, calloc and realloc to allocate memory dynamically. The document defines different types of linked lists like singly linked lists and explains basic linked list operations like traversing, inserting and deleting nodes. It concludes by discussing the pros and cons of linked lists.

Data Structures_Linked ListThenmozhiK5

The document discusses linked lists, which are a data structure made up of nodes that are connected to each other via links. Each node contains a data field and a link field pointing to the next node. The last node's link points to null to indicate the end of the list. Linked lists allow dynamic memory allocation and easy insertion/deletion of nodes. Common operations on linked lists include traversing the list, inserting nodes, deleting nodes, and searching for a node. Doubly linked lists are also discussed, where each node contains links to both the previous and next nodes.

UNIT 2LINKEDLISdddddddddddddddddddddddddddT.pptxshesnasuneer

A linked list is a linear data structure where elements are stored non-contiguously and linked using pointers, with various types including singly linked, doubly linked, and circular. Unlike arrays, linked lists offer dynamic sizing, faster insertions and deletions, and more efficient memory usage, although they have more overhead due to pointers. Basic operations include insertion, deletion, displaying the list, and searching for elements, with methods demonstrated for singly and doubly linked lists.

Bsf23006565 dsa 3rd assignment.docx............XEON14

Engineering.CSE.DataStructure.Linkedlist.noteslimev72215

The document discusses linked lists in data structures, explaining their representation and operations such as insertion, deletion, and traversal. It outlines different types of linked lists (singly, doubly, circular) and highlights their advantages and disadvantages compared to arrays. Additionally, it delves into memory management techniques like garbage collection and overflow/underflow scenarios in linked lists.

Unit 1 linked listLavanyaJ28

Linked lists allow for dynamic memory allocation by connecting nodes using pointers. There are several types of linked lists including singly linked, doubly linked, and circular linked lists. Singly linked lists use a single pointer to connect nodes in a linear fashion, while doubly linked lists use two pointers to allow traversal in both directions. Circular linked lists connect the last node back to the first to form a circular structure. Common operations on linked lists include insertion, deletion, traversal, and searching which are implemented through manipulating the pointers between nodes.

singlelinkedlistasdfghzxcvbnmqwertyuioparabailasghar3

The document provides an overview of linked lists, explaining their structure, operations, and various methods for adding and deleting nodes. It describes the node components, including data and link pointers, and outlines basic operations like traversal, insertion (append, add as first, add after), and deletion (of first, middle, last nodes). The document also includes code examples for implementing these operations in C++.

LinkedList1LinkedList1LinkedList1111.pdftimoemin50

Data structures linked list introduction.pptxKalpana Mohan

Linked lists are dynamic data structures that store data in scattered locations in memory. Each data item in a linked list is called a node, which contains a data field for storing the data and a pointer field linking to the next node. The basic operations on linked lists are insertion, deletion, and traversal. To insert a new node, the algorithm locates the proper position by traversing the list and comparing data, then links the new node between existing nodes. To delete a node, the algorithm locates the target node by traversing and comparing data, then establishes links between the previous and next nodes before deleting the target node.

DSModule2.pptxChrisSosaJacob

This document provides information on linked lists. Some key points: - A linked list is a dynamic data structure where elements are linked using pointers. Each element contains a data field and a pointer to the next node. - There are different types of linked lists including singly linked, doubly linked, circular, and circular doubly linked lists. - Common linked list operations include insertion, deletion, traversal, searching, and sorting. Algorithms for performing these operations on singly linked lists are presented. - Linked lists can be used to implement other data structures like stacks, where the top element is tracked using a pointer instead of using array indices. Pseudocode for push and pop operations on a linked list implementation of

Linked Lists.pdfKaynattariq1

The document provides a comprehensive guide on linked list data structures, including their definitions, types (single, double, and circular linked lists), and advantages over arrays. It details the basic operations involved such as insertion and deletion of nodes, along with the implementation in C++. Additionally, the document includes extensive explanations and steps for adding and deleting nodes in various scenarios.

This assignment and the next (#5) involve design and development of a.pdfEricvtJFraserr

The document details an assignment focused on designing and developing a linked list data structure from scratch in C++. It outlines the required tasks for constructing the listnode class, implementing key methods for insertion and removal of nodes, and testing the functionality in a main program. Additionally, it provides sample code snippets for the listnode template class as well as various methods to manipulate and test the linked list.

Linked list and its operations - Traversalkasthurimukila

The document discusses linked lists and operations performed on singly linked lists. It defines a linked list as a data structure containing nodes that point to the next node in the list. Singly linked lists contain nodes with a data field and pointer to the next node. Common operations on singly linked lists include traversing the list, inserting and deleting nodes from different positions, searching for a node, sorting list elements, and merging two linked lists.

Lecture 3 List of Data Structures & Algorithmshaseebanjum2611

Linked listKalaivaniKS1

Linked lists are linear data structures where elements are linked using pointers. The three main types are singly, doubly, and circular linked lists. Linked lists allow dynamic memory allocation and fast insertion/deletion compared to arrays but slower access. A linked list contains nodes, each with a data field and pointer to the next node. Basic operations on linked lists include insertion, deletion, traversal, and search. Doubly linked lists include pointers to both the next and previous nodes.

linkedlistwith animations.pptMuhammadShafi89

This document discusses linked lists and operations on them such as insertion and removal of nodes. It begins by showing the node declarations for a linked list, where each node contains a data field and a link field pointing to the next node. It then demonstrates how to insert a new node at the front of the list by allocating a new node, setting its data and link fields, and adjusting the head pointer. The document also provides pseudocode for inserting and removing nodes from linked lists in general cases.

Link List : Introduction to List and Linked ListsAnil Yadav

Link List REPRESENTATION OF DOUBLY LINKED LISTAnil Yadav

More Related Content

More from Anil Yadav (20)

Link List : Introduction to List and Linked ListsAnil Yadav

Link List REPRESENTATION OF DOUBLY LINKED LISTAnil Yadav

ALGORITHM FOR PUSHING AN ELEMENT TO A QUEUEAnil Yadav

Link List STACK and Queue USING LINKED LISTAnil Yadav

Link List & ALGORITHM FOR DELETING A NODEAnil Yadav

Link List ALGORITHM FOR INSERTING A NODEAnil Yadav

Presentations Linked Lists Data StructureAnil Yadav

Lec-12, 13 Quees First In First Out (FIFO)Anil Yadav

Lec-12, 13 Quee s Applications of QueuesAnil Yadav

The document discusses the applications of queues in operating systems, particularly in multi-user and multitasking environments, as well as in communication software for holding incoming information. It explains two types of queue implementations: static (using a fixed-size array) and dynamic (using a linked list that can change in size). Additionally, it describes a pointer implementation for managing queues with front and rear pointers for enqueuing and dequeuing operations.

Lec-12, 13 Quees Array Implementation INAnil Yadav

The document discusses the array-based implementation of queues, detailing how to manage the front and rear indices while enqueueing and dequeueing elements. It highlights the inefficiencies of using a single index and introduces circular queues to allow for better utilization of space. Additionally, it mentions the need for tracking the number of items in the queue to determine when it's empty or full.

Lec-12, 13 Quees In Queue IntQueue(int s)Anil Yadav

The document presents an implementation of an integer queue class in C++ with methods for enqueueing, dequeueing, checking if the queue is empty or full, and clearing the queue. It highlights the constructor and destructor for managing resources, and includes a simple demonstration program that enqueues five integers and attempts to enqueue a sixth, resulting in a full queue message. The output confirms the FIFO behavior of the queue by displaying the dequeued values.

Lec-12, 13 Quees A class for Dynamic Queue implementationAnil Yadav

Function enqueue inserts the value in numAnil Yadav

The document outlines the implementation of an integer queue class in C++, demonstrating its construction, destruction, and core functionalities like enqueue, dequeue, isempty, isfull, and clear. It includes a main program that tests the queue by enqueuing five items, handling an attempt to enqueue an additional item when the queue is full, and dequeuing all items to display their values. The program outputs relevant messages indicating the state of the queue throughout these operations.

Lec-12, 13 Quees -How to determine empty and full Queues?Anil Yadav

The document discusses the implementation of a queue using arrays, highlighting the management of front and rear indices. It explains the inefficiencies of using a single index and introduces the concept of a circular queue to allow for effective use of the available space. Additionally, it suggests using a counter to distinguish empty and full queues and outlines a class structure for managing the queue.

Unit2-BIS Business Information system DataAnil Yadav

The document outlines the interconnections between organizational strategy, competitive advantage, and information systems, emphasizing the importance of business processes and their improvement. It categorizes business processes into primary, management, and support types, detailing their functions and benefits such as risk and cost reduction, improved quality, and enhanced communication. Additionally, it discusses methodologies for business process improvement and reengineering while addressing the challenges associated with implementing these strategies.

Lec-12, 13 Queues - IntQueue IntQueue(int s) //constructorAnil Yadav

The document describes the implementation of an integer queue class in C++, including its constructor, destructor, and functions for enqueueing, dequeueing, and checking the state of the queue. The main function demonstrates the usage of the class by enqueuing five items, attempting to add a sixth, and then dequeuing all items. The output clearly indicates when the queue is full and lists the values retrieved from the queue.

Lec-12, 13 Quees Another implementation of Queues using ArraysAnil Yadav

Lec-12, 13 Quees - Circular Queues and Implementation with ArrayAnil Yadav

Lec-32 Recursion - Divide and Conquer in QueueAnil Yadav

The document contains examples of recursive functions in C++, demonstrating how to display numbers, sum integers, count digits, and evaluate exponents using both simple recursion and a divide and conquer approach. It also discusses the implementation of recursion using stacks, along with the advantages and disadvantages of recursion versus iteration. Overall, it highlights the efficiency and clarity of recursive programming methods.

Lec-32 Recursion -Recursion in Computer ScienceAnil Yadav

The document discusses mathematical functions with a focus on recursion, illustrating the calculation of specific values for functions like f(x) and factorials using recursive definitions. It emphasizes the importance of base cases to ensure recursion stops, highlighting examples such as the factorial function and Fibonacci numbers. Properly structured recursion can solve numerous algorithmic problems effectively.

Link List : Introduction to List and Linked ListsAnil Yadav

Link List REPRESENTATION OF DOUBLY LINKED LISTAnil Yadav

ALGORITHM FOR PUSHING AN ELEMENT TO A QUEUEAnil Yadav

Link List STACK and Queue USING LINKED LISTAnil Yadav

Link List & ALGORITHM FOR DELETING A NODEAnil Yadav

Link List ALGORITHM FOR INSERTING A NODEAnil Yadav

Presentations Linked Lists Data StructureAnil Yadav

Lec-12, 13 Quees First In First Out (FIFO)Anil Yadav

Lec-12, 13 Quee s Applications of QueuesAnil Yadav

Lec-12, 13 Quees Array Implementation INAnil Yadav

Lec-12, 13 Quees In Queue IntQueue(int s)Anil Yadav

Lec-12, 13 Quees A class for Dynamic Queue implementationAnil Yadav

Function enqueue inserts the value in numAnil Yadav

Lec-12, 13 Quees -How to determine empty and full Queues?Anil Yadav

Unit2-BIS Business Information system DataAnil Yadav

Lec-12, 13 Queues - IntQueue IntQueue(int s) //constructorAnil Yadav

Lec-12, 13 Quees Another implementation of Queues using ArraysAnil Yadav

Lec-12, 13 Quees - Circular Queues and Implementation with ArrayAnil Yadav

Lec-32 Recursion - Divide and Conquer in QueueAnil Yadav

Lec-32 Recursion -Recursion in Computer ScienceAnil Yadav

Recently uploaded (20)

Non-Communicable Diseases and National Health Programs – Unit 10 | B.Sc Nursi...RAKESH SAJJAN

This PowerPoint presentation is prepared for Unit 10 – Non-Communicable Diseases and National Health Programs, as per the 5th Semester B.Sc Nursing syllabus outlined by the Indian Nursing Council (INC) under the subject Community Health Nursing – I. This unit focuses on equipping students with knowledge of the causes, prevention, and control of non-communicable diseases (NCDs), which are a major public health challenge in India. The presentation emphasizes the nurse’s role in early detection, screening, management, and referral services under national-level programs. 🔹 Key Topics Included: Definition, burden, and impact of NCDs in India Epidemiology, risk factors, signs/symptoms, prevention, and management of: Diabetes Mellitus Hypertension Cardiovascular Diseases Stroke & Obesity Thyroid Disorders Blindness Deafness Injuries and Accidents (incl. road traffic injuries and trauma guidelines) NCD-2 Cancers: Breast Cancer Cervical Cancer Oral Cancer Risk factors, screening, diagnosis, early signs, referral & palliative care Role of nurse in screening, referral, counseling, and continuum of care National Programs: National Program for Prevention and Control of Cancer, Diabetes, Cardiovascular Diseases and Stroke (NPCDCS) National Program for Control of Blindness National Program for Prevention and Control of Deafness National Tobacco Control Program (NTCP) Introduction to Universal Health Coverage and Ayushman Bharat Use of standard treatment protocols and referral flowcharts This presentation is ideal for: Classroom lectures, field assignments, health education planning, and student projects Preparing for university exams, class tests, and community field postings

Capitol Doctoral Presentation -June 2025.pptxCapitolTechU

How to Manage Multi Language for Invoice in Odoo 18Celine George

Overview of Employee in Odoo 18 - Odoo SlidesCeline George

Battle of Bookworms 2025 - U25 Literature Quiz by Pragya Pragya - UEM Kolkata Quiz Club

Battle of Bookworms is a literature quiz organized by Pragya, UEM Kolkata, as part of their cultural fest Ecstasia. Curated by quizmasters Drisana Bhattacharyya, Argha Saha, and Aniket Adhikari, the quiz was a dynamic mix of classical literature, modern writing, mythology, regional texts, and experimental literary forms. It began with a 20-question prelim round where ‘star questions’ played a key tie-breaking role. The top 8 teams moved into advanced rounds, where they faced audio-visual challenges, pounce/bounce formats, immunity tokens, and theme-based risk-reward questions. From Orwell and Hemingway to Tagore and Sarala Das, the quiz traversed a global and Indian literary landscape. Unique rounds explored slipstream fiction, constrained writing, adaptations, and true crime literature. It included signature IDs, character identifications, and open-pounce selections. Questions were crafted to test contextual understanding, narrative knowledge, and authorial intent, making the quiz both intellectually rewarding and culturally rich. Battle of Bookworms proved literature quizzes can be insightful, creative, and deeply enjoyable for all.

BINARY files CSV files JSON files with example.pptxRamakrishna Reddy Bijjam

Overview of Off Boarding in Odoo 18 EmployeesCeline George

Revista digital preescolar en transformaciónguerragallardo26

BUSINESS QUIZ PRELIMS | QUIZ CLUB OF PSGCAS | 9 SEPTEMBER 2024Quiz Club of PSG College of Arts & Science

How to Configure Vendor Management in Lunch App of Odoo 18Celine George

How to Implement Least Package Removal Strategy in Odoo 18 InventoryCeline George

How to Manage Upselling of Subscriptions in Odoo 18Celine George

JHS SHS Back to School 2024-2025 .pptxmelvinapay78

Paper 107 | From Watchdog to Lapdog: Ishiguro’s Fiction and the Rise of “Godi...Rajdeep Bavaliya

Dive into a captivating analysis where Kazuo Ishiguro’s nuanced fiction meets the stark realities of post‑2014 Indian journalism. Uncover how “Godi Media” turned from watchdog to lapdog, echoing the moral compromises of Ishiguro’s protagonists. We’ll draw parallels between restrained narrative silences and sensationalist headlines—are our media heroes or traitors? Don’t forget to follow for more deep dives! M.A. Sem - 2 | Presentation Presentation Season - 2 Paper - 107: The Twentieth Century Literature: From World War II to the End of the Century Submitted Date: April 4, 2025 Paper Name: The Twentieth Century Literature: From World War II to the End of the Century Topic: From Watchdog to Lapdog: Ishiguro’s Fiction and the Rise of “Godi Media” in Post-2014 Indian Journalism [Please copy the link and paste it into any web browser to access the content.] Video Link: https://youtu.be/kIEqwzhHJ54 For a more in-depth discussion of this presentation, please visit the full blog post at the following link: https://rajdeepbavaliya2.blogspot.com/2025/04/from-watchdog-to-lapdog-ishiguro-s-fiction-and-the-rise-of-godi-media-in-post-2014-indian-journalism.html Please visit this blog to explore additional presentations from this season: Hashtags: #GodiMedia #Ishiguro #MediaEthics #WatchdogVsLapdog #IndianJournalism #PressFreedom #LiteraryCritique #AnArtistOfTheFloatingWorld #MediaCapture #KazuoIshiguro Keyword Tags: Godi Media, Ishiguro fiction, post-2014 Indian journalism, media capture, Kazuo Ishiguro analysis, watchdog to lapdog, press freedom India, media ethics, literature and media, An Artist of the Floating World

Exploring Ocean Floor Features for Middle SchoolMarie

SPENT QUIZ NQL JR FEST 5.0 BY SOURAV.pptxSourav Kr Podder

Basic English for Communication - Dr Hj Euis Eti Rohaeti MpdRestu Bias Primandhika

Introduction to Generative AI and Copilot.pdfTechSoup

june 10 2025 ppt for madden on art science is over.pptxroger malina

Energy Balances Of Oecd Countries 2011 Iea Statistics 1st Edition Oecdrazelitouali

Non-Communicable Diseases and National Health Programs – Unit 10 | B.Sc Nursi...RAKESH SAJJAN

Capitol Doctoral Presentation -June 2025.pptxCapitolTechU

How to Manage Multi Language for Invoice in Odoo 18Celine George

Overview of Employee in Odoo 18 - Odoo SlidesCeline George

Battle of Bookworms 2025 - U25 Literature Quiz by Pragya Pragya - UEM Kolkata Quiz Club

BINARY files CSV files JSON files with example.pptxRamakrishna Reddy Bijjam

Overview of Off Boarding in Odoo 18 EmployeesCeline George

Revista digital preescolar en transformaciónguerragallardo26

BUSINESS QUIZ PRELIMS | QUIZ CLUB OF PSGCAS | 9 SEPTEMBER 2024Quiz Club of PSG College of Arts & Science

How to Configure Vendor Management in Lunch App of Odoo 18Celine George

How to Implement Least Package Removal Strategy in Odoo 18 InventoryCeline George

How to Manage Upselling of Subscriptions in Odoo 18Celine George

JHS SHS Back to School 2024-2025 .pptxmelvinapay78

Paper 107 | From Watchdog to Lapdog: Ishiguro’s Fiction and the Rise of “Godi...Rajdeep Bavaliya

Exploring Ocean Floor Features for Middle SchoolMarie

SPENT QUIZ NQL JR FEST 5.0 BY SOURAV.pptxSourav Kr Podder

Basic English for Communication - Dr Hj Euis Eti Rohaeti MpdRestu Bias Primandhika

Introduction to Generative AI and Copilot.pdfTechSoup

june 10 2025 ppt for madden on art science is over.pptxroger malina

Energy Balances Of Oecd Countries 2011 Iea Statistics 1st Edition Oecdrazelitouali

Link List Programming Linked List in Cpp

1. Programming Linked List class LinkedList{ // declaration of the node struct node{ int info; node *next; }; //private variable declared node *start; public: LinkedList() // Constructor { start = NULL; } //public fucntion declared void AddAtBeg(int); void AddAfter(int, int); void Delete(); void Count(); void Search(int); void Display(); }; 20

2. Programming Linked List // following function will add new element at the beginning // also used to create first node void LinkedList::AddAtBeg(int data) { node * newNode; newNode = new node; newNode->info = data; newNode->next = start; start = newNode; }/*End of addatbeg()*/ 21

3. Programming Linked List //This function will add new element at any position void LinkedList::AddAfter(int data, int pos) { node *newNode, *q; q = start; if(q == NULL) { cout<<"nnEmpty linked list" << endl; return; } //Finding the position in the linked list to insert for(int i = 1; i < pos; i++) q = q->next; newNode = new node; newNode->info = data; newNode->next = q->next; q->next = newNode; } 22

4. Programming Linked List void LinkedList::Delete() { node *tmp, *ptr; int data; if(start == NULL) { cout<<"nn List is empty"<<endl; return; } cout<<"nnEnter the element for deletion : "; cin>>data; // delete first node if(start->info == data) { tmp = start; start = start->next; delete(tmp); return; } 23

5. ptr = start; while(ptr->info != data) { temp = ptr; ptr = ptr ->next; } tmp->next = ptr->next; delete(ptr); // Delete node in between, or last node }/*End of del()*/ 24

6. Programming Linked List void LinkedList::Display() { // Fill in the code that displays the contents of the linked list } /*End of display() */ void LinkedList::Count() { // Fill in the code that counts the nodes of the linked list } /*End of count() */ void LinkedList::Search(int data) { // Fill in the code that will find the position of a node that holds the ‘data’ } 25

7. Programming Linked List int main() { int choice, n, m, position, i; LinkedList po; while(1) { cout<<"1. Add at beginningn"; cout<<"2. Add after n"; cout<<"3. Deleten"; cout<<"4. Displayn"; cout<<"5. Countn"; 26

8. Programming Linked List cout<<"6. Searchn" cout<<"7. Quitn"; cout<<"n Enter your choice:"; cin>> choice; switch(choice) { case 1: cout<<"nnEnter the element:"; cin>>m; po.AddAtBeg(m); break; 27

9. Programming Linked List case 2: cout<<"nnEnter the element:"; cin>>m; cout<<"nPosition after inserted element:"; cin>>position; po.AddAfter(m,position); break; case 3: po.Delete(); break; case 4: po.Display(); break; case 5: po.Count(); break; case 6: cout<<"n nEnter the element to search:"; 28

10. Programming Linked List cin>>m; po.Search(m); break; case 7: exit(0); default: c out<<" n nWron g choice "; }/*End of switch */ 29

Link List Programming Linked List in Cpp

Recommended

More Related Content

Similar to Link List Programming Linked List in Cpp (20)

More from Anil Yadav (20)

Recently uploaded (20)

Link List Programming Linked List in Cpp