{"id":9144,"date":"2022-07-20T10:34:13","date_gmt":"2022-07-20T10:34:13","guid":{"rendered":"https:\/\/www.prepbytes.com\/blog\/?p=9144"},"modified":"2022-12-14T10:48:22","modified_gmt":"2022-12-14T10:48:22","slug":"level-order-traversal-line-set-3-using-one-queue","status":"publish","type":"post","link":"https:\/\/prepbytes.com\/blog\/level-order-traversal-line-set-3-using-one-queue\/","title":{"rendered":"Level Order Traversal Line Set 3 Using One Queue"},"content":{"rendered":"

\"\"<\/p>\n

Problem Statement:<\/h3>\n

Given a binary tree, print the nodes level by level or level wise and each level on a new line.<\/p>\n

Queue<\/h3>\n

A queue is basically a linear data structure that works on the principle of FIFO (First in First out)<\/strong> which means an element that is enqueued first will be dequeued first. Element is enqueued from the rear end of the queue and dequeued from the front end. The insertion operation in the queue is known as enqueue and the deletion operation in the queue is known as dequeue.
\nThe queue is used when the operations are to be performed in the manner of First in First out order just like Breadth-First Search. <\/p>\n

For Example A ticket Queue outside a cinema hall where the person enters the queue first will get the ticket first.<\/p>\n

\"\"<\/p>\n

Basic Operations of Queue:<\/h3>\n