{"id":161,"date":"2019-01-24T15:00:55","date_gmt":"2019-01-24T20:00:55","guid":{"rendered":"https:\/\/resrvoir.com\/?page_id=161"},"modified":"2025-06-17T23:03:15","modified_gmt":"2025-06-18T03:03:15","slug":"level-tree-traversal","status":"publish","type":"page","link":"https:\/\/resrvoir.com\/?page_id=161","title":{"rendered":"Level Tree Traversal (easy)"},"content":{"rendered":"\r\n<p>Given a binary tree, visit all nodes in level order, starting from the root level.<br \/><br \/>This can be solved by queueing and dequeueing nodes of the tree in a loop. Each node is enqueued, dequeued, and printed once.<br \/><br \/>The loop runs once for each node, which makes time complexity O(n) for a tree with n nodes.<\/p>\r\n\r\n\r\n\r\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=\"\">void levelTraversal(Node root) {\r\n  if (root == null)\r\n    return\r\n\r\n  Queue q = new Queue()\r\n\r\n  q.enqueue(root)\r\n\r\n  while (Node n = q.dequeue()) {\r\n    print(n.value)\r\n  \r\n    if (n.left)\r\n      q.enqueue(n.left)\r\n\r\n    if (n.right)\r\n      q.enqueue(n.right)\r\n  }\r\n}<\/pre>\r\n","protected":false},"excerpt":{"rendered":"<p>Given a binary tree, visit all nodes in level order, starting from the root level. This can be solved by queueing and dequeueing nodes of the tree in a loop. Each node is enqueued, dequeued, and printed once. The loop runs once for each node, which makes time complexity O(n) for a tree with n [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":2,"menu_order":7,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"_links":{"self":[{"href":"https:\/\/resrvoir.com\/index.php?rest_route=\/wp\/v2\/pages\/161"}],"collection":[{"href":"https:\/\/resrvoir.com\/index.php?rest_route=\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/resrvoir.com\/index.php?rest_route=\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/resrvoir.com\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/resrvoir.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=161"}],"version-history":[{"count":9,"href":"https:\/\/resrvoir.com\/index.php?rest_route=\/wp\/v2\/pages\/161\/revisions"}],"predecessor-version":[{"id":1416,"href":"https:\/\/resrvoir.com\/index.php?rest_route=\/wp\/v2\/pages\/161\/revisions\/1416"}],"up":[{"embeddable":true,"href":"https:\/\/resrvoir.com\/index.php?rest_route=\/wp\/v2\/pages\/2"}],"wp:attachment":[{"href":"https:\/\/resrvoir.com\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=161"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}