{"id":33842,"date":"2024-11-01T09:21:07","date_gmt":"2024-11-01T09:21:07","guid":{"rendered":"http:\/\/atmokpo.com\/w\/?p=33842"},"modified":"2024-11-01T10:55:51","modified_gmt":"2024-11-01T10:55:51","slug":"c-coding-test-course-binary-tree","status":"publish","type":"post","link":"https:\/\/atmokpo.com\/w\/33842\/","title":{"rendered":"C# Coding Test Course, Binary Tree"},"content":{"rendered":"<article>\n<section>\n<h2>Problem Description<\/h2>\n<p>\n            Write a function to calculate the sum of all paths in a given binary tree.<br \/>\n            A path is defined as the route from the root to a leaf node, and the sum of this path is the sum of the values of all nodes included in it.\n        <\/p>\n<h3>Input Format<\/h3>\n<ul>\n<li>Input: The root node of the binary tree is an instance of the TreeNode class.<\/li>\n<\/ul>\n<h3>Output Format<\/h3>\n<ul>\n<li>Output: Returns a list containing the sum of all paths.<\/li>\n<\/ul>\n<h4>Example<\/h4>\n<pre>\n            Input: [1, 2, 3]\n            Output: [3, 4]\n        <\/pre>\n<p>\n            In this example, the paths are 1 -> 2 and 1 -> 3. The sum of the first path is 3, and the sum of the second path is 4.\n        <\/p>\n<\/section>\n<section>\n<h2>Problem Analysis<\/h2>\n<p>\n            To solve this problem, we need a method to traverse the binary tree.<br \/>\n            The typical algorithms for this are Depth First Search (DFS) and Breadth First Search (BFS).<br \/>\n            In this case, DFS is more suitable. We will explore the nodes of each path using DFS and calculate the total sum of the path.\n        <\/p>\n<\/section>\n<section>\n<h2>Solution Strategy<\/h2>\n<p>\n            1. Visit each node using a recursive function.<br \/>\n            2. Add the value of the current node to the path sum.<br \/>\n            3. Check if the current node is a leaf node.<br \/>\n            4. If it is a leaf node, add the current sum to the list.<br \/>\n            5. If there are child nodes, recursively explore the child nodes.<br \/>\n            6. After exploration, remove the value of the current node from the path sum to return to the parent node.\n        <\/p>\n<\/section>\n<section>\n<h2>C# Code Implementation<\/h2>\n<p>\n            Below is the C# code to calculate the sum of all paths in a binary tree.\n        <\/p>\n<pre><code>\nusing System;\nusing System.Collections.Generic;\n\npublic class TreeNode {\n    public int val;\n    public TreeNode left;\n    public TreeNode right;\n    public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) {\n        this.val = val;\n        this.left = left;\n        this.right = right;\n    }\n}\n\npublic class Solution {\n    public IList<int> PathSum(TreeNode root) {\n        List<int> result = new List<int>();\n        FindPaths(root, 0, result);\n        return result;\n    }\n\n    private void FindPaths(TreeNode node, int currentSum, List<int> result) {\n        if (node == null) {\n            return;\n        }\n\n        currentSum += node.val;\n\n        \/\/ Check if we are at a leaf node\n        if (node.left == null && node.right == null) {\n            result.Add(currentSum);\n        } else {\n            \/\/ Traverse the left and right subtree\n            FindPaths(node.left, currentSum, result);\n            FindPaths(node.right, currentSum, result);\n        }\n    }\n}\n        <\/int><\/int><\/int><\/int><\/code><\/pre>\n<\/section>\n<section>\n<h2>Code Explanation<\/h2>\n<p>\n<strong>TreeNode Class<\/strong>: A class that represents each node of a binary tree.<br \/>\n            Each node can have an integer value (val), a left child (left), and a right child (right).\n        <\/p>\n<p>\n<strong>Solution Class<\/strong>: A class that contains methods for calculating path sums in a binary tree.<br \/>\n            The <code>PathSum<\/code> method invokes the <code>FindPaths<\/code> method to recursively explore the nodes.\n        <\/p>\n<ul>\n<li><strong>PathSum Method<\/strong>: Takes the given binary tree as input and returns a list of sums for all paths.<\/li>\n<li><strong>FindPaths Method<\/strong>: Takes the current node and the current path sum as arguments to explore recursively.<br \/>\n                When reaching a leaf node, it adds the current path sum to the list.\n            <\/li>\n<\/ul>\n<\/section>\n<section>\n<h2>Complexity Analysis<\/h2>\n<p>\n            The time complexity of this algorithm is O(N). N is the number of nodes in the tree.<br \/>\n            This is because we visit each node once. The space complexity is also O(H), where H is the height of the tree.<br \/>\n            This considers the stack space used by recursive calls.\n        <\/p>\n<\/section>\n<section>\n<h2>Conclusion<\/h2>\n<p>\n            This problem helps in understanding how to explore binary trees and the recursive approach.<br \/>\n            It is important to master these techniques to solve various binary tree problems.<br \/>\n            With adequate practice, one should become familiar with binary trees and their applications.\n        <\/p>\n<\/section>\n<\/article>\n","protected":false},"excerpt":{"rendered":"<p>Problem Description Write a function to calculate the sum of all paths in a given binary tree. A path is defined as the route from the root to a leaf node, and the sum of this path is the sum of the values of all nodes included in it. Input Format Input: The root node &hellip; <a href=\"https:\/\/atmokpo.com\/w\/33842\/\" class=\"more-link\">\ub354 \ubcf4\uae30<span class=\"screen-reader-text\"> &#8220;C# Coding Test Course, Binary Tree&#8221;<\/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":[90],"tags":[],"class_list":["post-33842","post","type-post","status-publish","format-standard","hentry","category-c-coding-test-tutorials"],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v26.2 - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>C# Coding Test Course, Binary Tree - \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\/33842\/\" \/>\n<meta property=\"og:locale\" content=\"ko_KR\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"C# Coding Test Course, Binary Tree - \ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8\" \/>\n<meta property=\"og:description\" content=\"Problem Description Write a function to calculate the sum of all paths in a given binary tree. A path is defined as the route from the root to a leaf node, and the sum of this path is the sum of the values of all nodes included in it. Input Format Input: The root node &hellip; \ub354 \ubcf4\uae30 &quot;C# Coding Test Course, Binary Tree&quot;\" \/>\n<meta property=\"og:url\" content=\"https:\/\/atmokpo.com\/w\/33842\/\" \/>\n<meta property=\"og:site_name\" content=\"\ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8\" \/>\n<meta property=\"article:published_time\" content=\"2024-11-01T09:21:07+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2024-11-01T10:55:51+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=\"3\ubd84\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/atmokpo.com\/w\/33842\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/atmokpo.com\/w\/33842\/\"},\"author\":{\"name\":\"root\",\"@id\":\"https:\/\/atmokpo.com\/w\/#\/schema\/person\/91b6b3b138fbba0efb4ae64b1abd81d7\"},\"headline\":\"C# Coding Test Course, Binary Tree\",\"datePublished\":\"2024-11-01T09:21:07+00:00\",\"dateModified\":\"2024-11-01T10:55:51+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/atmokpo.com\/w\/33842\/\"},\"wordCount\":451,\"publisher\":{\"@id\":\"https:\/\/atmokpo.com\/w\/#organization\"},\"articleSection\":[\"C# Coding Test Tutorials\"],\"inLanguage\":\"ko-KR\"},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/atmokpo.com\/w\/33842\/\",\"url\":\"https:\/\/atmokpo.com\/w\/33842\/\",\"name\":\"C# Coding Test Course, Binary Tree - \ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8\",\"isPartOf\":{\"@id\":\"https:\/\/atmokpo.com\/w\/#website\"},\"datePublished\":\"2024-11-01T09:21:07+00:00\",\"dateModified\":\"2024-11-01T10:55:51+00:00\",\"breadcrumb\":{\"@id\":\"https:\/\/atmokpo.com\/w\/33842\/#breadcrumb\"},\"inLanguage\":\"ko-KR\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/atmokpo.com\/w\/33842\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/atmokpo.com\/w\/33842\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"\ud648\",\"item\":\"https:\/\/atmokpo.com\/w\/en\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"C# Coding Test Course, Binary Tree\"}]},{\"@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":"C# Coding Test Course, Binary Tree - \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\/33842\/","og_locale":"ko_KR","og_type":"article","og_title":"C# Coding Test Course, Binary Tree - \ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8","og_description":"Problem Description Write a function to calculate the sum of all paths in a given binary tree. A path is defined as the route from the root to a leaf node, and the sum of this path is the sum of the values of all nodes included in it. Input Format Input: The root node &hellip; \ub354 \ubcf4\uae30 \"C# Coding Test Course, Binary Tree\"","og_url":"https:\/\/atmokpo.com\/w\/33842\/","og_site_name":"\ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8","article_published_time":"2024-11-01T09:21:07+00:00","article_modified_time":"2024-11-01T10:55:51+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":"3\ubd84"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/atmokpo.com\/w\/33842\/#article","isPartOf":{"@id":"https:\/\/atmokpo.com\/w\/33842\/"},"author":{"name":"root","@id":"https:\/\/atmokpo.com\/w\/#\/schema\/person\/91b6b3b138fbba0efb4ae64b1abd81d7"},"headline":"C# Coding Test Course, Binary Tree","datePublished":"2024-11-01T09:21:07+00:00","dateModified":"2024-11-01T10:55:51+00:00","mainEntityOfPage":{"@id":"https:\/\/atmokpo.com\/w\/33842\/"},"wordCount":451,"publisher":{"@id":"https:\/\/atmokpo.com\/w\/#organization"},"articleSection":["C# Coding Test Tutorials"],"inLanguage":"ko-KR"},{"@type":"WebPage","@id":"https:\/\/atmokpo.com\/w\/33842\/","url":"https:\/\/atmokpo.com\/w\/33842\/","name":"C# Coding Test Course, Binary Tree - \ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8","isPartOf":{"@id":"https:\/\/atmokpo.com\/w\/#website"},"datePublished":"2024-11-01T09:21:07+00:00","dateModified":"2024-11-01T10:55:51+00:00","breadcrumb":{"@id":"https:\/\/atmokpo.com\/w\/33842\/#breadcrumb"},"inLanguage":"ko-KR","potentialAction":[{"@type":"ReadAction","target":["https:\/\/atmokpo.com\/w\/33842\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/atmokpo.com\/w\/33842\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"\ud648","item":"https:\/\/atmokpo.com\/w\/en\/"},{"@type":"ListItem","position":2,"name":"C# Coding Test Course, Binary Tree"}]},{"@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\/33842","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=33842"}],"version-history":[{"count":1,"href":"https:\/\/atmokpo.com\/w\/wp-json\/wp\/v2\/posts\/33842\/revisions"}],"predecessor-version":[{"id":33843,"href":"https:\/\/atmokpo.com\/w\/wp-json\/wp\/v2\/posts\/33842\/revisions\/33843"}],"wp:attachment":[{"href":"https:\/\/atmokpo.com\/w\/wp-json\/wp\/v2\/media?parent=33842"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/atmokpo.com\/w\/wp-json\/wp\/v2\/categories?post=33842"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/atmokpo.com\/w\/wp-json\/wp\/v2\/tags?post=33842"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}