{"id":9124,"date":"2022-07-19T10:28:17","date_gmt":"2022-07-19T10:28:17","guid":{"rendered":"https:\/\/www.prepbytes.com\/blog\/?p=9124"},"modified":"2022-12-14T10:47:30","modified_gmt":"2022-12-14T10:47:30","slug":"right-view-binary-tree-using-queue","status":"publish","type":"post","link":"https:\/\/prepbytes.com\/blog\/right-view-binary-tree-using-queue\/","title":{"rendered":"Right View Binary Tree Using Queue"},"content":{"rendered":"

\"\"<\/p>\n

Problem Statement:<\/h3>\n

The problem is straightforward: we have given a binary tree and we have to print the right view of the binary tree.<\/p>\n

Let’s discuss it with an example:<\/p>\n

\"\"
\nOutput: 10 30 15 14
\nThese nodes are the rightmost nodes of their respective levels.<\/p>\n

What is a Binary Tree?<\/h3>\n

Binary tree is a type of Tree data structure in which every node in the tree will have 2 or less than 2 child nodes and those child nodes will be termed as the left child and the right child of the node.<\/p>\n

\"\"<\/p>\n

So, if we observe carefully, we\u2019ll find that the right view of a binary tree is the last node encountered at every level.Therefore, we can use the queue data structure<\/a> to traverse each level of the binary tree. At each level, we print only the value of the last node found at each level.<\/p>\n

Algorithm:<\/h3>\n