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 Stack using array: Algorithm We know stack is a normal array which follows LIFO.So to create stack we will need an array,the size of the array and a variable which will determine the top element of stack. push():To push element into stack we need to make sure that there is atleast
Basic Implementation of Stack using Array – Codewindow Read More »
