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 …
Author: admin2
What is Queue?
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 …
Circular Doubly Linked List(CDLL)
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 …
Searching of Data in DLL
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 DLL
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 …
Deletion of node at last(end) in DLL
For deleting the last node ,we have to traverse the whole list and reach the last node, at the last node ,we have to apply the deletion logic which is following : Take one Temp Variable and assign it by Read More …
Deletion of node at beginning(front) in DLL
To delete any node from front location of Doubly Linked List(DLL),we have to follow below steps : Take one Temp Variable and assign it by HeadPointer. Then we have to apply node arrangement and after node arrangement, delete the Temp Read More …
Insertion of node at specific location in DLL
Insertion of any node at any specific position in Doubly linked list(DLL), is something complex stuff,but we have to play with arrangement of node. First we have to create one Temp Variable and one flag. Traverse the node as per Read More …
Insertion of node at last(end) in DLL
For Last or End Insertion of node in Doubly Singly Linked List(DLL) ,we need some more iterations of node. we have to apply basic below rules : First we need one new node for inserting, So allocate the memory for new Read More …
Insertion of node at beginning(front) in DLL
Front Insertion of node is very easy in Doubly Singly Linked List(DLL). we have to apply some basic node arrangement. First we need one new node for inserting, So allocate the memory for new node. and then insert the new node Read More …