# Category Archives: Queue

Given Nodes with their priority, implement a priority queue using doubly linked list.  Prerequisite : Priority Queue push(): This function is used to insert a… Read More
Given a tree, print the level order traversal in sorted order. Examples : Input : 7 / \ 6 5 / \ / \ 4… Read More
Implement Priority Queue using Linked Lists.  push(): This function is used to insert a new data into the queue. pop(): This function removes the element… Read More
A simple python List can act as queue and stack as well. Queue mechanism is used widely and for many purposes in daily life. A… Read More
Deque also known as double eneded queue, as name suggests is a special kind of queue in which insertions and deletions can be done at the… Read More
Write a function to print ZigZag order traversal of a binary tree. For the below binary tree the zigzag order traversal will be 1 3… Read More
Deque or Double Ended Queue is a generalized version of Queue data structure that allows insert and delete at both ends. In previous post Implementation… Read More
I applied through an employee referral for SDET-1 position. I was interviewed at Amazon Chennai(SP Infocity).I faced 5 face to face rounds. On October 11th,… Read More
Given a queue of integers of even length, rearrange the elements by interleaving the first half of the queue with the second half of the… Read More
Online Coding Round: Time: 1.5 hr Questions Format: 20 MCQs + 2 Coding Questions MCQs were based on Data Structures, Operating systems etc. Coding Questions:… Read More
Give an algorithm for reversing a queue Q. Only following standard operations are allowed on queue. enqueue(x) : Add an item x to rear of… Read More
Given an integer k and a queue of integers, we need to reverse the order of the first k elements of the queue, leaving the… Read More
Given two n-ary trees, the task is to check if they are mirror of each other or not. Print “Yes” if they are mirror of… Read More
Given two binary trees, we have to check if each of their levels are anagrams of each other or not. Example: Tree 1: Level 0… Read More