Level Order Traversal Line Set 3 Using One Queue
Problem Statement: Given a binary tree, print the nodes level by level or level wise and each level on a new line. Queue A queue is basically a linear data...
What Are The Drawbacks Of Simple Queues In Data Structures
Queues are a fundamental data structure used in computer science to manage and store data. They are used in various applications, from operating systems to networking systems, and are widely...
Right View Binary Tree Using Queue
Problem Statement: The problem is straightforward: we have given a binary tree and we have to print the right view of the binary tree. Let's discuss it with an example:...
What is a device queue?
What is the queue? A queue is basically a linear data structure that works on the principle of FIFO (First in First out) which means an element that is enqueued(Insert)...
Kth Smallest Element In An Unsorted Array Using Priority Queue
Problem Statement: The problem statement is straightforward as we have an array of size n and we have to find the kth smallest element in an unsorted array using priority...
Priority Queue using Binary Heap
What is the priority queue? Priority queues are abstract data structures where each element in the queue has a priority value. For example, in any airline, baggage under the “First-Class”...
Circular Queue | Set 2 (Circular Linked List Implementation)
Circular Queue It is a linear data structure that works on the principle of FIFO (First in First out). In this type of queue element can be added in any...
Process scheduler PCBs and queueing
Process Scheduling: It is the activity of the process manager that handles the removal of the running process from the CPU and the selection of another process on the basis...
Convert a given Binary Tree To Circular Doubly Linked List
 In this article, we will deep dive and discuss how to convert the binary tree to circular doubly linked list. Converting a binary tree to circular doubly linked list...
Difference between Circular Queue and Priority Queue
Circular Queue It is a linear data structure that works on the principle of FIFO (First in First out). In this type of queue element can be added in any...
Sort the Queue using Recursion
Problem Statement: Given a queue, we have to sort the queue using a recursive function without using any loop. We can only use the standard functions for it:- enqueue(element): Add...
Reversing a Queue
In this article, we'll look at how to reverse a queue. We must reverse a queue with only standard operations: enqueue(element): Add an element to the queue's tail. dequeue(): Removes...
Reversing First K Elements Queue
Reverse the first k elements in the queue is a common problem in data structures and algorithms. A queue is a data structure that follows the FIFO (First In First...
Reversing Queue using Recursion
Problem Statement: Given a queue, we have to make a recursive function to reverse it. Queue: A Queue is a linear data structure. Queue follows the FIFO rule i.e. First...
Priority Queue using Doubly Linked List
Problem Statement: Given nodes with their priority, we have to implement a priority queue using a doubly linked list. What is a Priority Queue? Priority queues are abstract data structures...
Implementation Queue using Javascript
What is a Queue? Queue follows the principle of FIFO (First in First out) i.e. element which is inserted first will be removed first. The operation for insertion of elements...
Sorting Queue Without Extra Space
Sorting a queue without utilizing extra space presents an intriguing challenge in computer science. Queues, a fundamental data structure, follow the FIFO (First-In-First-Out) principle, making their sorting a complex task...
Difference Between MLQ And MLFQ CPU Scheduling Algorithms
MLQ scheduling is designed to handle situations where processes have different levels of priority or belong to different categories. It divides the ready queue, which contains all the processes waiting...
Multilevel Feedback Queue Scheduling MLFQ CPU Scheduling
What is Multilevel Queue Scheduling? In multilevel queue scheduling, all the processes are assigned permanently to the queue at the time of entry. Processes will not move between queues and...
Implement Priority Queue Comparator Java
Priority queues are specialized data structures that manage a set of elements each with an associated priority. Unlike regular queues, where elements are dequeued in the order they were enqueued...
Queue Interface Java
Firstly, we’ll see what the queue is. Queue A queue is basically a linear data structure that works on the principle of FIFO (First in First out) which means an...
Priority Queue Class In Java
Queue: The queue is a linear data structure that works on the principle of First in First out (FIFO). In the queue, the element which is added at least recently...
Different Types Of Queues And Its Applications
Queue A queue is basically a linear data structure that works on the principle of FIFO (First in First out) which means an element that is enqueued first will be...
Stack, Queue in Python using Module queue
In python, it is quite easy to implement stack and queue data structures. Stack works on the principle of LIFO (Last in First out) i.e. element which is inserted in...
Priority Queue using Array in C
Priority queues are fundamental data structures that play a crucial role in various computer science applications, from operating systems to graph algorithms and event-driven simulations. They provide efficient access to...
Multilevel Queue Scheduling
A multilevel queue scheduling algorithm divides the ready queue into multiple levels or tiers, each with a different priority. The appropriate level is then assigned to the processes based on...
10 Things to keep in mind while making a software developer resume
Are you starting on a job hunt as a software developer? Or do you want to stand out among your college mates in campus interviews? No matter which is the...
Advantages of Circular Queue over Linear Queue
The circular queue has several advantages over linear queue. It uses memory more efficiently because it can reuse the space that becomes available when elements are dequeued. The circular queue...
Merge two sorted arrays in Python using heapq
Heap Heap Data structure primarily focuses on representing priority queue. In Python, there is an inbuilt module “heapq” which is used for implementing Heap data structure. By default, Min Heap...
Merge two Binary Max-Heaps
Binary Max - Heap A binary max - heap follows two conditions: The given tree must be a complete binary tree (All levels are completely filled except the last level...