Linear data structures

Circular Queue

A linear data structure in which the operations are performed based on FIFO and the last position is connected back to the first position to make a circle.

Queue

A linear data structure in which the operations are performed based on FIFO principle.

Stack

A linear data structure in which the operations are performed based on LIFO principle.

Circular linked list

A sequence of elements in which every element has link to its next element in the sequence and the last element has a link to the first element in the sequence.

Double linked list

A sequence of elements in which every element has links to its previous element and next element in the sequence.

Array

A variable which can store multiple values of same data type at a time.

Node

Each element in a linked list is called as...

Front (head)

In a single linked list, the address of the first node is always stored in a reference node known as...

Single Linked List

Single linked list is a sequence of elements in which every element has link to its next element in the sequence.

deQueue

To delete an element from the queue

Pop

To delete an element from the stack

enQueue

To insert an element into the queue

Push

To insert an element on to the stack