Traverse the right subtree in pre-order.<\/li>\n<\/ol>\n\n For example, suppose we have the following tree structure.<\/p>\n
\n Public\n \u251c\u2500\u2500 User 1\n \u2502 \u251c\u2500\u2500 User 1.1\n \u2502 \u2514\u2500\u2500 User 1.2\n \u2514\u2500\u2500 User 2\n \u251c\u2500\u2500 User 2.1\n \u2514\u2500\u2500 User 2.2\n <\/pre>\n The result of the pre-order traversal is “Public, User 1, User 1.1, User 1.2, User 2, User 2.1, User 2.2”.\n <\/p>\n<\/section>\n\nIn-order Traversal<\/h2>\n
\n The method of in-order traversal is as follows:\n <\/p>\n
\n- Traverse the left subtree in in-order.<\/li>\n
- Visit the current node.<\/li>\n
- Traverse the right subtree in in-order.<\/li>\n<\/ol>\n
\n For example, in the same tree structure, the result of the in-order traversal is “User 1.1, User 1, User 1.2, Public, User 2.1, User 2, User 2.2”.\n <\/p>\n<\/section>\n\nPost-order Traversal<\/h2>\n
\n The method of post-order traversal is as follows:\n <\/p>\n
\n- Traverse the left subtree in post-order.<\/li>\n
- Traverse the right subtree in post-order.<\/li>\n
- Visit the current node.<\/li>\n<\/ol>\n
\n In the same tree structure, the result of the post-order traversal is “User 1.1, User 1.2, User 1, User 2.1, User 2.2, User 2, Public”.\n <\/p>\n<\/section>\n\nLevel-order Traversal<\/h2>\n
\n The method of level-order traversal is as follows:\n <\/p>\n
\n- Visit the root node.<\/li>\n
- Visit the child nodes of the current node.<\/li>\n
- After visiting all child nodes, move to the next depth.<\/li>\n<\/ol>\n
\n In the same tree structure, the result of the level-order traversal is “Public, User 1, User 2, User 1.1, User 1.2, User 2.1, User 2.2”.\n <\/p>\n<\/section>\n\nProgramming Problem: Binary Tree Traversal<\/h2>\n
\n Given the following binary tree structure, write a function to traverse the tree using various traversal methods.
\n A binary tree is composed of nodes structured as follows:\n <\/p>\n
\n class TreeNode {\n constructor(value) {\n this.value = value;\n this.left = null;\n this.right = null;\n }\n }\n <\/pre>\n\n Example Input:\n <\/p>\n
\n const root = new TreeNode(1);\n root.left = new TreeNode(2);\n root.right = new TreeNode(3);\n root.left.left = new TreeNode(4);\n root.left.right = new TreeNode(5);\n <\/pre>\nProblem<\/h3>\n
\n Write a function for pre-order, in-order, post-order, and level-order traversal of the binary tree above.\n <\/p>\n<\/section>\n\nProblem Solving Process<\/h2>\n1. Implementing Pre-order Traversal<\/h3>\n
\n To perform pre-order traversal, a recursive approach is needed. Below is the code that implements this:\n <\/p>\n
\n function preOrderTraversal(node) {\n if (node === null) return;\n console.log(node.value); \/\/ Visit current node\n preOrderTraversal(node.left); \/\/ Visit left subtree\n preOrderTraversal(node.right); \/\/ Visit right subtree\n }\n <\/pre>\n\n The above code visits the current node first and then traverses the left and right nodes.\n <\/p>\n
2. Implementing In-order Traversal<\/h3>\n
\n In-order traversal is also implemented recursively. Below is the in-order traversal code:\n <\/p>\n
\n function inOrderTraversal(node) {\n if (node === null) return;\n inOrderTraversal(node.left); \/\/ Visit left subtree\n console.log(node.value); \/\/ Visit current node\n inOrderTraversal(node.right); \/\/ Visit right subtree\n }\n <\/pre>\n\n This code visits the left subtree first and then the current node.\n <\/p>\n
3. Implementing Post-order Traversal<\/h3>\n
\n Post-order traversal is also implemented recursively. Below is the implemented code:\n <\/p>\n
\n function postOrderTraversal(node) {\n if (node === null) return;\n postOrderTraversal(node.left); \/\/ Visit left subtree\n postOrderTraversal(node.right); \/\/ Visit right subtree\n console.log(node.value); \/\/ Visit current node\n }\n <\/pre>\n\n In post-order traversal, the current node is visited after both child subtrees.\n <\/p>\n
4. Implementing Level-order Traversal<\/h3>\n
\n Level-order traversal is implemented using a queue data structure. By using a queue, each node can be visited layer by layer. Below is the level-order traversal code:\n <\/p>\n
\n function levelOrderTraversal(root) {\n if (root === null) return;\n const queue = [root]; \/\/ Initialize the queue\n while (queue.length > 0) {\n const current = queue.shift(); \/\/ Remove node from the queue\n console.log(current.value); \/\/ Visit current node\n if (current.left) queue.push(current.left); \/\/ Add left child\n if (current.right) queue.push(current.right); \/\/ Add right child\n }\n }\n <\/pre>\n\n Using a queue allows each node to be visited in order by level.\n <\/p>\n<\/section>\n\nConclusion<\/h2>\n
\n In this course, we explored various methods of traversing trees using JavaScript.
\n Tree traversal is a fundamental part of many programming problems, so it’s important to practice sufficiently.
\n Understanding and implementing the pre-order, in-order, post-order, and level-order traversal algorithms covered above is a great way to achieve good results in coding tests.\n <\/p>\n
\n Continue to solve various algorithm problems through practice. Practice and repetition are the best teachers!\n <\/p>\n<\/section>\n<\/article>\n
<\/body><\/p>\n","protected":false},"excerpt":{"rendered":"
Overview In coding tests, various data structure and algorithm problems are presented. Among them, trees are a commonly occurring data structure. Tree structures play a very important role in computer science and are utilized in various fields such as file systems and databases. In this course, we will learn how to traverse trees using JavaScript. … \ub354 \ubcf4\uae30 “JavaScript Coding Test Course, Traversing Trees”<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_jetpack_memberships_contains_paid_content":false,"footnotes":""},"categories":[141],"tags":[],"class_list":["post-34642","post","type-post","status-publish","format-standard","hentry","category-javascript-coding-test"],"yoast_head":"\nJavaScript Coding Test Course, Traversing Trees - \ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/atmokpo.com\/w\/34642\/\" \/>\n<meta property=\"og:locale\" content=\"ko_KR\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"JavaScript Coding Test Course, Traversing Trees - \ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8\" \/>\n<meta property=\"og:description\" content=\"Overview In coding tests, various data structure and algorithm problems are presented. Among them, trees are a commonly occurring data structure. Tree structures play a very important role in computer science and are utilized in various fields such as file systems and databases. In this course, we will learn how to traverse trees using JavaScript. … \ub354 \ubcf4\uae30 "JavaScript Coding Test Course, Traversing Trees"\" \/>\n<meta property=\"og:url\" content=\"https:\/\/atmokpo.com\/w\/34642\/\" \/>\n<meta property=\"og:site_name\" content=\"\ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8\" \/>\n<meta property=\"article:published_time\" content=\"2024-11-01T09:30:25+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2024-11-01T11:40:22+00:00\" \/>\n<meta name=\"author\" content=\"root\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:creator\" content=\"@bebubo4\" \/>\n<meta name=\"twitter:site\" content=\"@bebubo4\" \/>\n<meta name=\"twitter:label1\" content=\"\uae00\uc4f4\uc774\" \/>\n\t<meta name=\"twitter:data1\" content=\"root\" \/>\n\t<meta name=\"twitter:label2\" content=\"\uc608\uc0c1 \ub418\ub294 \ud310\ub3c5 \uc2dc\uac04\" \/>\n\t<meta name=\"twitter:data2\" content=\"4\ubd84\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/atmokpo.com\/w\/34642\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/atmokpo.com\/w\/34642\/\"},\"author\":{\"name\":\"root\",\"@id\":\"https:\/\/atmokpo.com\/w\/#\/schema\/person\/91b6b3b138fbba0efb4ae64b1abd81d7\"},\"headline\":\"JavaScript Coding Test Course, Traversing Trees\",\"datePublished\":\"2024-11-01T09:30:25+00:00\",\"dateModified\":\"2024-11-01T11:40:22+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/atmokpo.com\/w\/34642\/\"},\"wordCount\":631,\"publisher\":{\"@id\":\"https:\/\/atmokpo.com\/w\/#organization\"},\"articleSection\":[\"Javascript Coding Test\"],\"inLanguage\":\"ko-KR\"},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/atmokpo.com\/w\/34642\/\",\"url\":\"https:\/\/atmokpo.com\/w\/34642\/\",\"name\":\"JavaScript Coding Test Course, Traversing Trees - \ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8\",\"isPartOf\":{\"@id\":\"https:\/\/atmokpo.com\/w\/#website\"},\"datePublished\":\"2024-11-01T09:30:25+00:00\",\"dateModified\":\"2024-11-01T11:40:22+00:00\",\"breadcrumb\":{\"@id\":\"https:\/\/atmokpo.com\/w\/34642\/#breadcrumb\"},\"inLanguage\":\"ko-KR\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/atmokpo.com\/w\/34642\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/atmokpo.com\/w\/34642\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"\ud648\",\"item\":\"https:\/\/atmokpo.com\/w\/en\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"JavaScript Coding Test Course, Traversing Trees\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/atmokpo.com\/w\/#website\",\"url\":\"https:\/\/atmokpo.com\/w\/\",\"name\":\"\ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8\",\"description\":\"\",\"publisher\":{\"@id\":\"https:\/\/atmokpo.com\/w\/#organization\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/atmokpo.com\/w\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"ko-KR\"},{\"@type\":\"Organization\",\"@id\":\"https:\/\/atmokpo.com\/w\/#organization\",\"name\":\"\ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8\",\"url\":\"https:\/\/atmokpo.com\/w\/\",\"logo\":{\"@type\":\"ImageObject\",\"inLanguage\":\"ko-KR\",\"@id\":\"https:\/\/atmokpo.com\/w\/#\/schema\/logo\/image\/\",\"url\":\"https:\/\/atmokpo.com\/w\/wp-content\/uploads\/2024\/11\/logo.png\",\"contentUrl\":\"https:\/\/atmokpo.com\/w\/wp-content\/uploads\/2024\/11\/logo.png\",\"width\":400,\"height\":400,\"caption\":\"\ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8\"},\"image\":{\"@id\":\"https:\/\/atmokpo.com\/w\/#\/schema\/logo\/image\/\"},\"sameAs\":[\"https:\/\/x.com\/bebubo4\"]},{\"@type\":\"Person\",\"@id\":\"https:\/\/atmokpo.com\/w\/#\/schema\/person\/91b6b3b138fbba0efb4ae64b1abd81d7\",\"name\":\"root\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"ko-KR\",\"@id\":\"https:\/\/atmokpo.com\/w\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/secure.gravatar.com\/avatar\/708197b41fc6435a7ce22d951b25d4a47e9e904270cb1f04682d4f025066f80c?s=96&d=mm&r=g\",\"contentUrl\":\"https:\/\/secure.gravatar.com\/avatar\/708197b41fc6435a7ce22d951b25d4a47e9e904270cb1f04682d4f025066f80c?s=96&d=mm&r=g\",\"caption\":\"root\"},\"sameAs\":[\"http:\/\/atmokpo.com\/w\"],\"url\":\"https:\/\/atmokpo.com\/w\/author\/root\/\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"JavaScript Coding Test Course, Traversing Trees - \ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/atmokpo.com\/w\/34642\/","og_locale":"ko_KR","og_type":"article","og_title":"JavaScript Coding Test Course, Traversing Trees - \ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8","og_description":"Overview In coding tests, various data structure and algorithm problems are presented. Among them, trees are a commonly occurring data structure. Tree structures play a very important role in computer science and are utilized in various fields such as file systems and databases. In this course, we will learn how to traverse trees using JavaScript. … \ub354 \ubcf4\uae30 \"JavaScript Coding Test Course, Traversing Trees\"","og_url":"https:\/\/atmokpo.com\/w\/34642\/","og_site_name":"\ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8","article_published_time":"2024-11-01T09:30:25+00:00","article_modified_time":"2024-11-01T11:40:22+00:00","author":"root","twitter_card":"summary_large_image","twitter_creator":"@bebubo4","twitter_site":"@bebubo4","twitter_misc":{"\uae00\uc4f4\uc774":"root","\uc608\uc0c1 \ub418\ub294 \ud310\ub3c5 \uc2dc\uac04":"4\ubd84"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/atmokpo.com\/w\/34642\/#article","isPartOf":{"@id":"https:\/\/atmokpo.com\/w\/34642\/"},"author":{"name":"root","@id":"https:\/\/atmokpo.com\/w\/#\/schema\/person\/91b6b3b138fbba0efb4ae64b1abd81d7"},"headline":"JavaScript Coding Test Course, Traversing Trees","datePublished":"2024-11-01T09:30:25+00:00","dateModified":"2024-11-01T11:40:22+00:00","mainEntityOfPage":{"@id":"https:\/\/atmokpo.com\/w\/34642\/"},"wordCount":631,"publisher":{"@id":"https:\/\/atmokpo.com\/w\/#organization"},"articleSection":["Javascript Coding Test"],"inLanguage":"ko-KR"},{"@type":"WebPage","@id":"https:\/\/atmokpo.com\/w\/34642\/","url":"https:\/\/atmokpo.com\/w\/34642\/","name":"JavaScript Coding Test Course, Traversing Trees - \ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8","isPartOf":{"@id":"https:\/\/atmokpo.com\/w\/#website"},"datePublished":"2024-11-01T09:30:25+00:00","dateModified":"2024-11-01T11:40:22+00:00","breadcrumb":{"@id":"https:\/\/atmokpo.com\/w\/34642\/#breadcrumb"},"inLanguage":"ko-KR","potentialAction":[{"@type":"ReadAction","target":["https:\/\/atmokpo.com\/w\/34642\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/atmokpo.com\/w\/34642\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"\ud648","item":"https:\/\/atmokpo.com\/w\/en\/"},{"@type":"ListItem","position":2,"name":"JavaScript Coding Test Course, Traversing Trees"}]},{"@type":"WebSite","@id":"https:\/\/atmokpo.com\/w\/#website","url":"https:\/\/atmokpo.com\/w\/","name":"\ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8","description":"","publisher":{"@id":"https:\/\/atmokpo.com\/w\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/atmokpo.com\/w\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"ko-KR"},{"@type":"Organization","@id":"https:\/\/atmokpo.com\/w\/#organization","name":"\ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8","url":"https:\/\/atmokpo.com\/w\/","logo":{"@type":"ImageObject","inLanguage":"ko-KR","@id":"https:\/\/atmokpo.com\/w\/#\/schema\/logo\/image\/","url":"https:\/\/atmokpo.com\/w\/wp-content\/uploads\/2024\/11\/logo.png","contentUrl":"https:\/\/atmokpo.com\/w\/wp-content\/uploads\/2024\/11\/logo.png","width":400,"height":400,"caption":"\ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8"},"image":{"@id":"https:\/\/atmokpo.com\/w\/#\/schema\/logo\/image\/"},"sameAs":["https:\/\/x.com\/bebubo4"]},{"@type":"Person","@id":"https:\/\/atmokpo.com\/w\/#\/schema\/person\/91b6b3b138fbba0efb4ae64b1abd81d7","name":"root","image":{"@type":"ImageObject","inLanguage":"ko-KR","@id":"https:\/\/atmokpo.com\/w\/#\/schema\/person\/image\/","url":"https:\/\/secure.gravatar.com\/avatar\/708197b41fc6435a7ce22d951b25d4a47e9e904270cb1f04682d4f025066f80c?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/708197b41fc6435a7ce22d951b25d4a47e9e904270cb1f04682d4f025066f80c?s=96&d=mm&r=g","caption":"root"},"sameAs":["http:\/\/atmokpo.com\/w"],"url":"https:\/\/atmokpo.com\/w\/author\/root\/"}]}},"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"jetpack-related-posts":[],"_links":{"self":[{"href":"https:\/\/atmokpo.com\/w\/wp-json\/wp\/v2\/posts\/34642","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/atmokpo.com\/w\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/atmokpo.com\/w\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/atmokpo.com\/w\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/atmokpo.com\/w\/wp-json\/wp\/v2\/comments?post=34642"}],"version-history":[{"count":1,"href":"https:\/\/atmokpo.com\/w\/wp-json\/wp\/v2\/posts\/34642\/revisions"}],"predecessor-version":[{"id":34643,"href":"https:\/\/atmokpo.com\/w\/wp-json\/wp\/v2\/posts\/34642\/revisions\/34643"}],"wp:attachment":[{"href":"https:\/\/atmokpo.com\/w\/wp-json\/wp\/v2\/media?parent=34642"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/atmokpo.com\/w\/wp-json\/wp\/v2\/categories?post=34642"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/atmokpo.com\/w\/wp-json\/wp\/v2\/tags?post=34642"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}