{"id":7314,"date":"2022-08-10T23:05:00","date_gmt":"2022-08-10T17:35:00","guid":{"rendered":"https:\/\/www.codingbroz.com\/?p=7314"},"modified":"2022-08-05T15:16:55","modified_gmt":"2022-08-05T09:46:55","slug":"tree-manager-hackerrank-solution","status":"publish","type":"post","link":"https:\/\/www.codingbroz.com\/tree-manager-hackerrank-solution\/","title":{"rendered":"Tree Manager &#8211; HackerRank Solution"},"content":{"rendered":"\n<p>In this post, we will solve <strong>Tree Manager HackerRank Solution<\/strong>. This problem <strong>(Tree Manager)<\/strong> is a part of <strong>HackerRank Functional Programming<\/strong> series.<\/p>\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-6636a78821e22\" 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-6636a78821e22\" 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\/tree-manager-hackerrank-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-2\" href=\"https:\/\/www.codingbroz.com\/tree-manager-hackerrank-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-3\" href=\"https:\/\/www.codingbroz.com\/tree-manager-hackerrank-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-4\" href=\"https:\/\/www.codingbroz.com\/tree-manager-hackerrank-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-5\" href=\"https:\/\/www.codingbroz.com\/tree-manager-hackerrank-solution\/#Solution_%E2%80%93_Tree_Manager_%E2%80%93_HackerRank_Solution\" title=\"Solution &#8211; Tree Manager &#8211; HackerRank Solution\">Solution &#8211; Tree Manager &#8211; HackerRank Solution<\/a><\/li><\/ul><\/nav><\/div>\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>In this problem you must perform operations on a rooted tree storing integers in each node. There are several operations to handle:<\/p>\n\n\n\n<ul><li><strong><em>changeValue<\/em>(<em>x<\/em>)<\/strong>&#8211; Changes the value stored in the current node to\u00a0<em><strong>x<\/strong><\/em>.<\/li><li><em><strong>print()<\/strong><\/em>\u00a0&#8211; Prints the values stored in the current node.<\/li><li><em><strong>visitLeft()<\/strong><\/em>\u00a0&#8211; Sets the current node to be the left sibling of the current node.<\/li><li><em><strong>visitRight()<\/strong><\/em>\u00a0&#8211; Sets the current node to be the right sibling of the current node.<\/li><li><em><strong>visitParent()<\/strong><\/em>\u00a0&#8211; Sets the current node to be the parent of the current node.<\/li><li><strong><em>visitChild(n)<\/em><\/strong>\u00a0&#8211; Sets the current node to be the\u00a0<em><strong>n<sup>th<\/sup><\/strong><\/em>\u00a0child of the current node. Children are numbered from left to right starting from\u00a0<strong>1<\/strong>.<\/li><li><em><strong>insertLeft(x)<\/strong><\/em>\u00a0&#8211; Inserts a new node with value\u00a0<em><strong>x<\/strong><\/em>\u00a0as the left sibling of the current node.<\/li><li><em><strong>insertRight(x)<\/strong><\/em>\u00a0&#8211; Inserts a new node with value\u00a0<em><strong>x<\/strong><\/em>\u00a0as the right sibling of the current node.<\/li><li><em><strong>insertChild(x)<\/strong><\/em>\u00a0&#8211; Inserts a new node as the leftmost child of the current node.<\/li><li><strong><em>delete()<\/em><\/strong>\u00a0&#8211; Deletes the current node with the subtree rooted in it and sets the current node as a parent of just deleted node.<\/li><\/ul>\n\n\n\n<p>Knowing that the tree initially consists of the root with value\u00a0<strong>0<\/strong>, your task is to perform\u00a0<em><strong>Q<\/strong><\/em>\u00a0consecutive operations.<\/p>\n\n\n\n<p>Check the\u00a0<em>Input Format<\/em>\u00a0section for a description of how each operation is given in the input, and review the\u00a0<em>Constraints<\/em>\u00a0section to clarify which operations are not allowed for the root node.<\/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 first line contains a single integer,\u00a0<em><strong>Q<\/strong><\/em>, denoting the number of operations to perform. The\u00a0<em><strong>Q<\/strong><\/em>\u00a0subsequent lines each describe a single operation to perform. The operations are coded as follows:<\/p>\n\n\n\n<ul><li><strong>change x -> <em>changeValue<\/em>(<em>x<\/em>)<\/strong><\/li><li><strong>print -> <em>print<\/em>()<\/strong><\/li><li><strong>visit left -> <em>visitLeft<\/em>()<\/strong><\/li><li><strong>visit right -> <em>visitRight<\/em>()<\/strong><\/li><li><strong>visit parent -> <em>visitParent<\/em>()<\/strong><\/li><li><strong>visit child n -> <em>visitChild<\/em>(<em>n<\/em>)<\/strong><\/li><li><strong>insert left x -> <em>insertLeft<\/em>(<em>x<\/em>)<\/strong><\/li><li><strong>insert right x -> <em>insertRight<\/em>(<em>x<\/em>)<\/strong><\/li><li><strong>insert child x -> <em>insertChild<\/em>(<em>x<\/em>)<\/strong><\/li><li><strong>delete -> <em>delete<\/em>()<\/strong><\/li><\/ul>\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>Q<\/em> &lt;= 10<sup>5<\/sup><\/strong><\/li><li><strong>0 &lt;= <em>x<\/em> &lt;= 10<sup>6<\/sup><\/strong><\/li><li><strong>1 &lt;= <em>n<\/em> &lt;= 10<\/strong><\/li><li>It is guaranteed that all operations given as input will be valid.<\/li><\/ul>\n\n\n\n<p>Invalid operations are:<\/p>\n\n\n\n<ul><li>Visiting left\/right sibling when there is no such sibling.<\/li><li>Visiting the\u00a0<strong><em>n<sup>th<\/sup><\/em><\/strong>\u00a0child when there are less than\u00a0<em><strong>n<\/strong><\/em>\u00a0children.<\/li><li>Deleting the root.<\/li><li>Inserting any sibling of the root.<\/li><li>A single node will never have more than\u00a0<strong>10<\/strong>\u00a0children.<\/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>For each\u00a0<strong><em>print<\/em>()<\/strong>\u00a0operation, output a single line with the value in the current node.<\/p>\n\n\n\n<p><strong>Sample Input<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code has-ast-global-color-5-color has-ast-global-color-8-background-color has-text-color has-background\"><code>11\r\nchange 1\r\nprint\r\ninsert child 2\r\nvisit child 1\r\ninsert right 3\r\nvisit right\r\nprint\r\ninsert right 4\r\ndelete\r\nvisit child 2\r\nprint<\/code><\/pre>\n\n\n\n<p><strong>Sample Output<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code has-ast-global-color-5-color has-ast-global-color-8-background-color has-text-color has-background\"><code>1\r\n3\r\n4<\/code><\/pre>\n\n\n\n<p><strong>Explanation<\/strong><\/p>\n\n\n\n<p>There are\u00a0<strong>11<\/strong>\u00a0operations to handle.<br>At the beginning, we change the value stored in the root to\u00a01\u00a0and then we print it.<br>After that, we insert a new child of the root with value\u00a0<strong>2<\/strong>.<br>Then, we visit this child and insert a new node with value\u00a0<strong>3<\/strong>\u00a0as its right sibling.<br>Next, we visit the last inserted node and print its value.<br>After that, we insert a new node with value\u00a0<strong>4<\/strong>\u00a0as the right sibling of last inserted node.<br>Then, we delete the current node (the one with value\u00a0<strong>3<\/strong>), so the current node becomes the root.<br>Next, we visit the second child of the root, which is the last inserted node with value\u00a0<strong>4<\/strong>\u00a0(because we deleted the node with value\u00a0<strong>3<\/strong>).<br>Finally, we print the value stored in the current node, which is\u00a0<strong>4<\/strong>.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Solution_%E2%80%93_Tree_Manager_%E2%80%93_HackerRank_Solution\"><\/span><strong>Solution &#8211; Tree Manager &#8211; HackerRank Solution<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p><strong>Scala<\/strong><\/p>\n\n\n\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"scala\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">import java.util.Scanner\n\ntrait Tree {\n  def value: Int\n\n  def value_=(v: Int): Unit\n\n  def children: Array[Tree]\n\n  def children_=(v: Array[Tree]): Unit\n\n  def parent: Tree\n}\n\nobject Tree {\n  val MaxChildCount = 10\n\n  def createChildren: Array[Tree] = Array.ofDim[Tree](Tree.MaxChildCount)\n}\n\nclass Node(var value: Int, val parent: Tree, var children: Array[Tree]) extends Tree\n\ncase object Empty extends Tree {\n  override def value: Int = exception\n\n  override def value_=(v: Int): Unit = exception\n\n  override def children: Array[Tree] = exception\n\n  override def children_=(v: Array[Tree]): Unit = exception\n\n  private def exception = throw new Exception(\"The operation is not supported.\")\n\n  override def parent: Tree = exception\n}\n\nobject Solution {\n  def main(args: Array[String]): Unit = {\n    val sc = new Scanner(System.in)\n\n    val q = sc.nextInt\n    sc.nextLine\n\n    val root = new Node(0, Empty, Tree.createChildren)\n    var current: Tree = root\n\n    (0 until q).foreach(_ => {\n      val tokens = sc.nextLine.split(\" \")\n\n      tokens.head match {\n        case \"change\" => current.value = tokens(1).toInt\n        case \"print\" => println(current.value)\n        case \"visit\" => tokens(1) match {\n          case \"left\" =>\n            val index = current.parent.children.indexOf(current)\n            current = current.parent.children(index - 1)\n          case \"right\" =>\n            val index = current.parent.children.indexOf(current)\n            current = current.parent.children(index + 1)\n          case \"parent\" =>\n            current = current.parent\n          case \"child\" =>\n            current = current.children(tokens(2).toInt - 1)\n        }\n        case \"insert\" =>\n          def insertSibling(pos: Int): Unit = {\n            val node = new Node(tokens(2).toInt, current.parent, Tree.createChildren)\n            val index = current.parent.children.indexOf(current) + pos\n            current.parent.children = (current.parent.children.take(index) :+ node) ++ current.parent.children.drop(index)\n          }\n\n          tokens(1) match {\n            case \"left\" =>\n              insertSibling(0)\n            case \"right\" =>\n              insertSibling(1)\n            case \"child\" =>\n              val node = new Node(tokens(2).toInt, current, Tree.createChildren)\n              current.children = node +: current.children\n          }\n        case \"delete\" =>\n          val temp = current\n          current = current.parent\n          current.children = current.children.filter(_ != temp) :+ Empty\n      }\n    })\n\n    sc.close()\n  }\n}\n<\/pre>\n\n\n\n<p><strong>Note:<\/strong> This problem <strong>(<a href=\"https:\/\/www.hackerrank.com\/challenges\/tree-manager\/problem\" target=\"_blank\" rel=\"noreferrer noopener nofollow\">Tree Manager<\/a>)<\/strong> is generated by <strong><a href=\"https:\/\/www.hackerrank.com\/\" target=\"_blank\" rel=\"noreferrer noopener nofollow\">HackerRank<\/a><\/strong> but the solution is provided by <strong><a href=\"https:\/\/www.codingbroz.com\/\">CodingBroz<\/a><\/strong>. This tutorial is only for <strong>Educational<\/strong> and <strong>Learning<\/strong> purpose.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>In this post, we will solve Tree Manager HackerRank Solution. This problem (Tree Manager) is a part of HackerRank Functional Programming series.<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"site-sidebar-layout":"default","site-content-layout":"","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":"","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,684],"tags":[692],"jetpack_sharing_enabled":true,"jetpack_featured_media_url":"","jetpack-related-posts":[],"_links":{"self":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/7314"}],"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\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/comments?post=7314"}],"version-history":[{"count":2,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/7314\/revisions"}],"predecessor-version":[{"id":7317,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/7314\/revisions\/7317"}],"wp:attachment":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/media?parent=7314"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/categories?post=7314"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/tags?post=7314"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}