Author:

Similar to the Linked list and Queue ADT ,Stack is also use for storing the data.Stack is also an Sequential type data structure. Stack in Real Life Example of Push and Pop Operation Operations of Stack There are following some Read More …

We can implement the Queue in two ways :1-: Using HeadPointer Only (Not a good Approach,we will not discuss).2-: Using HeadPointer and TailPointer (Preferable Approach) 1- EnQueue & DeQueue(Insertion & Deletion Operation) Working process of EnQueue and DeQueue is following Read More …

Whats Problems in the Dynamic Array and Simple Circular Array Representation? In above figure Initial two spaces are empty be DeQueue operation,because first we filled the whole Queue,and then delete the two DataElements,So now rear is pointing to last index.and Read More …

Simple Circular Array Representation of Queue is extended version of Simple Array Representation of Queue , but this is also not an efficient and good representation of Queue,because Array size will be fixed. and we have to define this array Read More …

Dynamic Array Representation of Queue is better than Simple Array Representation , Dynamic Array Representation is something efficient and good representation of Queue,because Array size will be doubled when array size if full. we can say that Dynamic array representation Read More …

Simple Array Representation of Queue is very simple , but this is not an efficient and good representation of Queue,because Array size will be fixed. and we have to define this array size at beginning ,and we can not change Read More …

Similar to the linked list ,Queue is also an Storage type data structure to store the data.Queue is also an Sequential type data structure.Queue have the following properties : Queue in Real Life Operations of Queue There are following some Read More …

Structure of Circular Linked List is Following : Example : Node Representation Operations of Circular Doubly Linked List(CDLL) There are following operations ,we can apply on Circular Doubly linked list : Insertion of node at beginning(front) in CDLL : Insertion Read More …

In Doubly Linked List(DLL), If we want to know the existence of an data element then we have to apply Search operation : First we have to create one Temp variable,and assign the address of HeadPointer to it. Now start Read More …

Deletion of Node at specific location in Doubly Linked List(DLL) is something complex process ,we have to follow the below Steps : Take one Temp variable and assign it by HeadPointer Traverse the List till location by Temp variable. When Read More …