Hot Topics Data Structure Algorithm: Prepare the structure of a doubly linked list with its data member Take two pointers front and rear and initiate them with NULL push():To push a node in queue create a new node and if the queue is empty then insert the node and assign both front and rear pointer […]
Hot Topics Data Structure Operations on singular linked list 1. Insert First Algorithm We are assuming that there already exist atleast one node and a head pointer is pointing to it. Create a new node and attach that node to the head of the linked list. Reassign the head to the newly added node Code:
Top 18 basic Singular Linked list operations -Codewindow Read More »
Hot Topics Data Structure Linked List Linked list is a type of linear data structure that is made by collection of nodes.It is a dynamic data structure whose size can be increased and decreased during runtime.This way there is no wastage of memory.It is easy to do insertion and deletion because we don’t need to
Hot Topics Data Structure Circular Queue using Linked List Algorithm Create a class called Node which will have the data members of linked list Create a class called CircularQueue which will make an array of node type push() – To push element in circular queue there might be two cases When the queue is
Hot Topics Data Structure Circular Queue A circular queue is a special kind of queue in which the last element is attached/connected to the first element of queue.A circular queue can be thought as a ring.The main advantage of using a circular queue is that if we have some space before the space to which
Basic Introduction to Circular Queue – Codewindow Read More »
Hot Topics Data Structure Dequeue using LinkedList Algorithm Create a node structure with data and next as two data members Also create two pointers front and rear and set them to NULL Check if the queue is empty pushFront() – To push a node at front we have 2 case When the dequeue is empty
Basic Implementation of Dequeue using LinkedList – Codewindow Read More »
Hot Topics Data Structure Dequeue using Array Algorithm Take an array and two pointers called front and rear,initiate both of them at -1 as at first the dequeue will be empty pushFront() – To push elements at the front of dequeue we can have 4 cases. Check for if the dequeue is full Check if
