Linked List - Data Structure - Cyber Thieve

Linked List in Data Structure

Read More : 

What is Data Structure & Algorithms

Introduction to algorithms

What is Tree in Data Structure Full Detail

What Is Sorting

What is Binary Search Tree

A linked list is a linear data structure that includes a series of connected nodes. Nodes are not stored at contiguous memory locations. The nodes in a linked list are linked using pointers Here each node stores the data and the address of the next node. 

A linked list consists of nodes where each node contains a data field and a reference(link) to the next node in the list.

Pointer :  pointer is a reference node that hold or store the address of the next node in link list

Linked List - operations :

• Searching(Traversing)
• Insertion
• Deletion

Representation - Link List :

how each node of the linked list is represented.

• A data item
• An address of another node.

struct node
{
  int data;
  struct node *next;
};

link list - type

• Linear Linked List

• Circular Linked Linear List

• Doubly Linear Linked List

Liked List - Application or Uses

Linked lists are used in a wide variety of applications.

• The polynomial manipulation.

• Maintain directory of names. This type of problem occurs in compiler construction to store the list of identifiers appearing in a program for maintaining symbol table.

• Perform arithmetic operations on long integers.

•  Implement sparse matrices.

• Implement a line editor, where we can keep a linked list of line nodes, each containing a line number, a line of text and a pointer to the next line node.

• Dynamic memory allocation

• Implemented in stack and queue

• In undo functionality of software 

• Hash tables, Graphs

NOTE : If you fine any mistake or weakness in my article please help us to improve our content.

Top Posts :

Advantages of Object Oriented Programming
Object and Classes in C++
C++ Object Oriented Programming