{"id":2009,"date":"2021-05-29T11:51:07","date_gmt":"2021-05-29T06:21:07","guid":{"rendered":"https:\/\/www.codingbroz.com\/?p=2009"},"modified":"2021-06-20T22:48:20","modified_gmt":"2021-06-20T17:18:20","slug":"day-23-bst-level-order-traversal-solution","status":"publish","type":"post","link":"https:\/\/www.codingbroz.com\/day-23-bst-level-order-traversal-solution\/","title":{"rendered":"Day 23: BST Level-Order Traversal | 30 Days Of Code | HackerRank Solution"},"content":{"rendered":"\n<p>Hello coders, today we are going to solve <strong>Day 23: BST Level-Order Traversal HackerRank Solution<\/strong> in<strong> C++<\/strong>, <strong>Java<\/strong> and <strong>Python<\/strong>.<\/p>\n\n\n\n<figure class=\"wp-block-image size-large\"><img fetchpriority=\"high\" decoding=\"async\" width=\"1200\" height=\"675\" src=\"https:\/\/www.codingbroz.com\/wp-content\/uploads\/2021\/05\/day-23-bts-level-order-30-days-of-code-solution-codingbroz.png\" alt=\"Day 23: BST Level-Order Traversal \" class=\"wp-image-2011\" srcset=\"https:\/\/www.codingbroz.com\/wp-content\/uploads\/2021\/05\/day-23-bts-level-order-30-days-of-code-solution-codingbroz.png 1200w, https:\/\/www.codingbroz.com\/wp-content\/uploads\/2021\/05\/day-23-bts-level-order-30-days-of-code-solution-codingbroz-768x432.png 768w\" sizes=\"(max-width: 1200px) 100vw, 1200px\" \/><\/figure>\n\n\n\n<div id=\"ez-toc-container\" class=\"ez-toc-v2_0_65 ez-toc-wrap-left counter-hierarchy ez-toc-counter ez-toc-custom ez-toc-container-direction\">\n<label for=\"ez-toc-cssicon-toggle-item-662cc7f34399d\" class=\"ez-toc-cssicon-toggle-label\"><label class=\"ez-toc-title\">Table of Contents<\/label>\n<span class=\"ez-toc-cssicon\"><span class=\"eztoc-hide\" style=\"display:none;\">Toggle<\/span><span class=\"ez-toc-icon-toggle-span\"><svg style=\"fill: #0090ff;color:#0090ff\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" class=\"list-377408\" width=\"20px\" height=\"20px\" viewBox=\"0 0 24 24\" fill=\"none\"><path d=\"M6 6H4v2h2V6zm14 0H8v2h12V6zM4 11h2v2H4v-2zm16 0H8v2h12v-2zM4 16h2v2H4v-2zm16 0H8v2h12v-2z\" fill=\"currentColor\"><\/path><\/svg><svg style=\"fill: #0090ff;color:#0090ff\" class=\"arrow-unsorted-368013\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" width=\"10px\" height=\"10px\" viewBox=\"0 0 24 24\" version=\"1.2\" baseProfile=\"tiny\"><path d=\"M18.2 9.3l-6.2-6.3-6.2 6.3c-.2.2-.3.4-.3.7s.1.5.3.7c.2.2.4.3.7.3h11c.3 0 .5-.1.7-.3.2-.2.3-.5.3-.7s-.1-.5-.3-.7zM5.8 14.7l6.2 6.3 6.2-6.3c.2-.2.3-.5.3-.7s-.1-.5-.3-.7c-.2-.2-.4-.3-.7-.3h-11c-.3 0-.5.1-.7.3-.2.2-.3.5-.3.7s.1.5.3.7z\"\/><\/svg><\/span><\/span><\/label><input type=\"checkbox\"  id=\"ez-toc-cssicon-toggle-item-662cc7f34399d\" checked \/><nav><ul class='ez-toc-list ez-toc-list-level-1 ' ><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-1\" href=\"https:\/\/www.codingbroz.com\/day-23-bst-level-order-traversal-solution\/#Objective\" title=\"Objective\">Objective<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-2\" href=\"https:\/\/www.codingbroz.com\/day-23-bst-level-order-traversal-solution\/#Task\" title=\"Task\">Task<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-3\" href=\"https:\/\/www.codingbroz.com\/day-23-bst-level-order-traversal-solution\/#Input_Format\" title=\"Input Format\">Input Format<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-4\" href=\"https:\/\/www.codingbroz.com\/day-23-bst-level-order-traversal-solution\/#Constraints\" title=\"Constraints\">Constraints<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-5\" href=\"https:\/\/www.codingbroz.com\/day-23-bst-level-order-traversal-solution\/#Output_Format\" title=\"Output Format\">Output Format<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-6\" href=\"https:\/\/www.codingbroz.com\/day-23-bst-level-order-traversal-solution\/#Solution_%E2%80%93_Day_23_BST_Level-Order_Traversal\" title=\"Solution &#8211; Day 23: BST Level-Order Traversal\">Solution &#8211; Day 23: BST Level-Order Traversal<\/a><ul class='ez-toc-list-level-3' ><li class='ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-7\" href=\"https:\/\/www.codingbroz.com\/day-23-bst-level-order-traversal-solution\/#C\" title=\"C++\">C++<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-8\" href=\"https:\/\/www.codingbroz.com\/day-23-bst-level-order-traversal-solution\/#Java\" title=\"Java\">Java<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-9\" href=\"https:\/\/www.codingbroz.com\/day-23-bst-level-order-traversal-solution\/#Python\" title=\"Python\">Python<\/a><\/li><\/ul><\/li><\/ul><\/nav><\/div>\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Objective\"><\/span><strong>Objective<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p>Today, we&#8217;re going further with Binary Search Trees.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Task\"><\/span><strong>Task<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p>A level-order traversal, also known as a breadth-first search, visits each level of a tree&#8217;s nodes from left to right, top to bottom. You are given a pointer,&nbsp;<em><strong>root<\/strong><\/em>, pointing to the root of a binary search tree. Complete the&nbsp;<em>levelOrder<\/em>&nbsp;function provided in your editor so that it prints the level-order traversal of the binary search tree.<\/p>\n\n\n\n<p><strong>Hint:<\/strong>&nbsp;You&#8217;ll find a queue helpful in completing this challenge.<\/p>\n\n\n\n<p><strong>Function Description<\/strong><\/p>\n\n\n\n<p>Complete the&nbsp;<em>levelOrder<\/em>&nbsp;function in the editor below.<\/p>\n\n\n\n<p><em>levelOrder<\/em>&nbsp;has the following parameter:<br>&#8211;&nbsp;<em>Node pointer root<\/em>: a reference to the root of the tree<\/p>\n\n\n\n<p><strong>Prints<\/strong><br>&#8211; Print node.data items as space-separated line of integers. No return value is expected.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Input_Format\"><\/span><strong>Input Format<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p>The locked stub code in your editor reads the following inputs and assembles them into a BST:<br>The first line contains an integer,&nbsp;<strong><em>T<\/em><\/strong>&nbsp;(the number of test cases).<br>The&nbsp;<strong><em>T<\/em><\/strong>&nbsp;subsequent lines each contain an integer,&nbsp;<strong><em>data<\/em><\/strong>, denoting the value of an element that must be added to the BST.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Constraints\"><\/span><strong>Constraints<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<ul><li><strong>1 &lt;= <em>N<\/em> &lt;= 20<\/strong><\/li><li><strong>1 &lt;= <em>node.data<\/em>[<em>i<\/em>] &lt;= 100<\/strong><\/li><\/ul>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Output_Format\"><\/span><strong>Output Format<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p>Print the&nbsp;<em><strong>data<\/strong><\/em>&nbsp;value of each node in the tree&#8217;s level-order traversal as a single line of&nbsp;<strong><em>N<\/em><\/strong>&nbsp;space-separated integers.<\/p>\n\n\n\n<p><strong>Sample Input<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>6\n3\n5\n4\n7\n2\n1<\/code><\/pre>\n\n\n\n<p><strong>Sample Output <\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>3 2 5 1 4 7 <\/code><\/pre>\n\n\n\n<p><strong>Explanation<\/strong><\/p>\n\n\n\n<p>We traverse each level of the tree from the root downward, and we process the nodes at each level from left to right. The resulting level-order traversal is<strong>&nbsp;3 = 2 = 5 = 1 = 4 = 7<\/strong>, and we print these data values as a single line of space-separated integers.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Solution_%E2%80%93_Day_23_BST_Level-Order_Traversal\"><\/span><strong>Solution &#8211; Day 23: BST Level-Order Traversal<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<h3 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"C\"><\/span><strong>C++<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h3>\n\n\n\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"cpp\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">#include &lt;iostream>\n#include &lt;cstddef>\n#include &lt;queue>\n#include &lt;string>\n#include &lt;cstdlib>\n\nusing namespace std;\t\nclass Node{\n    public:\n        int data;\n        Node *left,*right;\n        Node(int d){\n            data=d;\n            left=right=NULL;\n        }\n};\nclass Solution{\n    public:\n  \t\tNode* insert(Node* root, int data){\n            if(root==NULL){\n                return new Node(data);\n            }\n            else{\n                Node* cur;\n                if(data&lt;=root->data){\n                    cur=insert(root->left,data);\n                    root->left=cur;\n                }\n                else{\n                   cur=insert(root->right,data);\n                   root->right=cur;\n                 }           \n           return root;\n           }\n        }\n     \n  void levelOrder(Node * root){\n    queue&lt;Node *> q;\n    Node* n = root;\n   \n    while(n != NULL){\n        cout &lt;&lt; n->data &lt;&lt; ' ';\n        \n        if( n->left  != NULL ) q.push(n->left);\n        if( n->right != NULL ) q.push(n->right);\n        if( !q.empty() ) {\n         n = q.front();\n         q.pop();\n        } else {\n         n = NULL;\n        }\n    }\n}\n};\/\/End of Solution\nint main(){\n    Solution myTree;\n    Node* root=NULL;\n    int T,data;\n    cin>>T;\n    while(T-->0){\n        cin>>data;\n        root= myTree.insert(root,data);\n    }\n    myTree.levelOrder(root);\n    return 0;\n}<\/pre>\n\n\n\n<script async src=\"https:\/\/pagead2.googlesyndication.com\/pagead\/js\/adsbygoogle.js\"><\/script>\n<ins class=\"adsbygoogle\"\n     style=\"display:block; text-align:center;\"\n     data-ad-layout=\"in-article\"\n     data-ad-format=\"fluid\"\n     data-ad-client=\"ca-pub-5246141430412355\"\n     data-ad-slot=\"8798433565\"><\/ins>\n<script>\n     (adsbygoogle = window.adsbygoogle || []).push({});\n<\/script>\n\n\n\n<h3 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Java\"><\/span><strong>Java<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h3>\n\n\n\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"java\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">import java.util.*;\nimport java.io.*;\nclass Node{ Node left,right;\nint data; Node(int data){ this.data=data; left=right=null;\n }\n}\n \n class Solution{ static void levelOrder(Node root){\n      \/\/Write your code here\n    int height=getHeight(root);\n    for(int i=1;i&lt;=height;i++) { printEachLevel(root,i);\n    }\n } static void printEachLevel(Node root,int eachLevel)\n  {\n       if (root == null) return;\n       if (eachLevel == 1) System.out.print(root.data + \" \");\n       else if (eachLevel > 1) { printEachLevel(root.left, eachLevel-1); printEachLevel(root.right, eachLevel-1); } }\n       static int getHeight(Node root){ \n           \/\/Write your code here\n           if(root == null) { return 0; }\n           else \n           {\n                int lHeight= getHeight(root.left); int rHeight=getHeight(root.right); if(lHeight>rHeight) { return (lHeight+1); } else return (rHeight+1); } } public static Node insert(Node root,int data){ if(root==null){ return new Node(data); } else{ Node cur; if(data&lt;=root.data){ cur=insert(root.left,data); root.left=cur; } else{ cur=insert(root.right,data); root.right=cur; } return root; } } public static void main(String args[]){ Scanner sc=new Scanner(System.in); int T=sc.nextInt(); Node root=null; while(T-->0){ int data=sc.nextInt(); root=insert(root,data); } levelOrder(root); } }<\/pre>\n\n\n\n<h3 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Python\"><\/span><strong>Python<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h3>\n\n\n\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"python\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">import sys\n\nclass Node:\n    def __init__(self,data):\n        self.right=self.left=None\n        self.data = data\nclass Solution:\n    def insert(self,root,data):\n        if root==None:\n            return Node(data)\n        else:\n            if data&lt;=root.data:\n                cur=self.insert(root.left,data)\n                root.left=cur\n            else:\n                cur=self.insert(root.right,data)\n                root.right=cur\n        return root\n    def levelOrder(self, root):\n        queue = [root]\n        while len(queue) is not 0:\n            curr = queue[0]\n            queue = queue[1:]\n            print(str(curr.data) + \" \", end=\"\")\n\n            if curr.left is not None:\n                queue.append(curr.left)\n            if curr.right is not None:\n                queue.append(curr.right)\nT=int(input())\nmyTree=Solution()\nroot=None\nfor i in range(T):\n    data=int(input())\n    root=myTree.insert(root,data)\nmyTree.levelOrder(root)\n<\/pre>\n\n\n\n<script async src=\"https:\/\/pagead2.googlesyndication.com\/pagead\/js\/adsbygoogle.js\"><\/script>\n<ins class=\"adsbygoogle\"\n     style=\"display:block; text-align:center;\"\n     data-ad-layout=\"in-article\"\n     data-ad-format=\"fluid\"\n     data-ad-client=\"ca-pub-5246141430412355\"\n     data-ad-slot=\"8798433565\"><\/ins>\n<script>\n     (adsbygoogle = window.adsbygoogle || []).push({});\n<\/script>\n\n\n\n<p><strong>Disclaimer:<\/strong> The above Problem <strong>(<a href=\"https:\/\/www.hackerrank.com\/challenges\/30-binary-trees\/problem\" target=\"_blank\" rel=\"noreferrer noopener\" class=\"rank-math-link\">Day 23: BST Level-Order Traversal<\/a>)<\/strong> is generated by <strong>Hacker Rank<\/strong> but the Solution is Provided by <strong>CodingBroz<\/strong>. This tutorial is only for <strong>Educational<\/strong> and<strong> Learning<\/strong> Purpose.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Hello coders, today we are going to solve Day 23: BST Level-Order Traversal HackerRank Solution in C++, Java and Python.<\/p>\n","protected":false},"author":1,"featured_media":2011,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"site-sidebar-layout":"default","site-content-layout":"default","ast-site-content-layout":"","site-content-style":"default","site-sidebar-style":"default","ast-global-header-display":"","ast-banner-title-visibility":"","ast-main-header-display":"","ast-hfb-above-header-display":"","ast-hfb-below-header-display":"","ast-hfb-mobile-header-display":"","site-post-title":"","ast-breadcrumbs-content":"","ast-featured-img":"","footer-sml-layout":"","theme-transparent-header-meta":"default","adv-header-id-meta":"","stick-header-meta":"","header-above-stick-meta":"","header-main-stick-meta":"","header-below-stick-meta":"","astra-migrate-meta-layouts":"default","ast-page-background-enabled":"default","ast-page-background-meta":{"desktop":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"tablet":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"mobile":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""}},"ast-content-background-meta":{"desktop":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"tablet":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"mobile":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""}},"_jetpack_memberships_contains_paid_content":false,"footnotes":""},"categories":[9,160],"tags":[171,80,18],"jetpack_sharing_enabled":true,"jetpack_featured_media_url":"https:\/\/www.codingbroz.com\/wp-content\/uploads\/2021\/05\/day-23-bts-level-order-30-days-of-code-solution-codingbroz.png","jetpack-related-posts":[],"_links":{"self":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/2009"}],"collection":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/comments?post=2009"}],"version-history":[{"count":3,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/2009\/revisions"}],"predecessor-version":[{"id":3537,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/2009\/revisions\/3537"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/media\/2011"}],"wp:attachment":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/media?parent=2009"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/categories?post=2009"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/tags?post=2009"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}