Header AD

Singly Linked List in C++ Data Strucures

Singly Linked List

A singly linked list is a linear data structure that consists of a group of nodes, each pointing to the next node by means of a pointer. Each node, except for the first one, contains two parts: #data #pointer to next element in the list.

The simplest way to create this type of list is by using an array. Each element of the array represents one node and stores both data and pointer. The first element of the array does not store any data because it doesn't need to link to anything.


In this pdf/post of Singly linked list in C++ Data structures and algorithm, you will learn about how to insert a node at the start as well as on Rear/End and Nth/the Desired position.

 You will also be able to know how to perform deletion in Singly Linked Lists from the start as well as rear/end and nth position.

Note: If  You have the basic understanding of struct or structure in C++ or even in C, then it is very easy for you to understand this pdf.

Data Structures

Data structures are used to store and organize information. A data structure is a conceptual organization of data in a computer so that it can be used efficiently. Data structures provide a way to manage large amounts of data effectively.

The six major types of data structures are:

  1. lists
  2. stacks
  3. queues
  4. trees
  5. heaps
  6. graphs

Why Data Structures?

Main memory stores data more quickly than disks or other storage media, because it can be accessed more quickly than disks. It's vital to understand how the operating system retrieves data from memory without using the hard disk. A Data Structure is usually used to organize your data.

Types Of Data Structures

All data structures are divided into two categories:
  • Linear: Linear data structures store information in sequential order. A linked list is an example of a nonlinear data structure. Linked lists are better for insertion and deletion.
  • Nonlinear: nonlinear data structures do not. While an array is an example of a linear one. Arrays are faster for random access. 

The efficiency of data access and update operations are central to the performance of many applications. For example, if an application needs to read or modify only one specific element of a large collection, then accessing that element directly would be more efficient than reading or modifying all elements sequentially. 

There are two types of structure:

  • Collection Structure
  • Linked Structure
Data structures include the fundamental components of the digital world: bits, bytes, numbers, characters, strings, records, files, and objects.

Download Solved Papers From  PDFNOTES.INFO

The primary reason why students and professionals should use pdfnotes.info for downloading free past papers is: This website allows users to download notes, lectures, and books in PDF format.

We provide past papers for many countries of the world. We have over 100s of solved papers on this site, all of which are fully past-paper compatible and available for free. The best thing about using our website is that you don't need to worry about downloads or storage space as all the papers can be accessed from our cloud server.

Note: These papers are available for free download in the Past Papers section of this website.

Request From Our Side:

If you give us solved papers or any other self-made notes, we will include your name in the section provided. If you want to share your solved papers, please send them via email at [thepdfnotes@gmail.com]

Download Button

Since the entire paper is an open book test, you can go through previous years' papers. You can refer to different sources that have the subject's past papers. Just study one paper at a time and give it your best shot.

we assure you that after preparing the provided notes you will be able to attempt your examination questions. But remember that we have done our responsibility and it's your move to work hard and prepare these notes.


Please do not enter any spam link in comment box.

  1. Assalam O Alaikum and Hi Everyone..!
    Today I'm going to share a mistake that I found while revising the notes..,in deleting last node function : void delete (){
    /* we have to reach to the last node but keeping the address of second last node, why? Because if last node is deleted then the 2nd last node will be the last node having 'Null' in the address. So simply replace " delete(pre) " with " delete(current)".

    :) Stay Happy ☺, Thanks


Post a Comment

Please do not enter any spam link in comment box.

Post a Comment

Previous Post Next Post


Post ADS 1