# Tag: linear data structure

## Memory Efficient Doubly Linked List – Explanation and Implementation

The memory efficient doubly linked list, also known as XOR linked list is a modification of doubly linked list where each node is same as the node of

## 3D Arrays in C language – How to declare, initialize and access elements

In our previous tutorials we have discussed that C programming allows multiple dimensions in arrays like 1D arrays, 2D arrays. Similarly, we can have three or more dimensions too.

## 2D Arrays in C language – How to declare, initialize and access elements

We already know that arrays are a collection of the same type of data that have a fixed size(in C programming language as in other languages we can

## 1D Arrays in C language – How to declare, initialize and access elements

An array is a collection of data that holds a fixed number of values of the same data type. These are declared under the same variable name and are

## Priority Queue – Introduction, Explanation and Implementation

Priority Queue is a data structure which is similar to Queue and Stack. Moreover, it is an extension to queue with following properties Each item is associated with

## Queue – Introduction, Explanation and Implementation

A queue is a data structure used to store items that has defined way of Insertion and Deletion operation. It follows First in First Out(FIFO) means items inserted

## Stack – Introduction, Explanation and Implementation

A stack is a data structure used to store items that has defined way of Insertion and Deletion operation. It follows Last in First Out(LIFO) means items inserted

## Doubly Linked List – Explanation and Implementation

A doubly linked list is an advanced form of linked list which has the ability to traverse back and forth i.e. in both the direction. It possesses an