Given a binary tree, print the level order traversal of its node’s values.
If you see the below example, the level order traversal of binary tree is 7, 6, 5, 4, 3, 2, 1.
level by level traversal of binary tree
How to implement a queue using two stacks. In this tutorial, We are going to discuss an algorithm and java code to implement a queue using two stacks.
Write a program to implement a queue using an array. In this tutorial, You are going to learn about Queue data structure and their implementation using an array in C, C++ & Java. In my previous posts, I have explained Stack and Linked List data structure.
Queue Data Structure
In Queue data structure, An element is inserted at one end called rear and deleted at other end called front. As compared to stack data structure in which insertion and deletion are allowed only at one end. Queue data structure is also called FIFO (First In First out).
MCQ on stack and queue data structure. A Stack and Queue data structure is very important in computer science. In this tutorial, you are going to learn about stack and queue data structure. Also you’ll find MCQ on stack and queues.
In my previous post i have discussed following things.
Stack program in C using Array.
Queue data structure and their implementation.
The purpose of this objective questions is to test how well you understand the concept of stack and queue.