C++ Coding Test Course, Counting the Number of Leaf Nodes - \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\/34178\/\" \/>\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, Counting the Number of Leaf Nodes - \ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8\" \/>\n<meta property=\"og:description\" content=\"This article will explain in detail how to count the number of leaf nodes using the C++ programming language. It is structured to be easily understandable from start to finish, including the process of solving the algorithm problem and the code. Problem Description A leaf node refers to a node that has no child nodes. … \ub354 \ubcf4\uae30 "C++ Coding Test Course, Counting the Number of Leaf Nodes"\" \/>\n<meta property=\"og:url\" content=\"https:\/\/atmokpo.com\/w\/34178\/\" \/>\n<meta property=\"og:site_name\" content=\"\ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8\" \/>\n<meta property=\"article:published_time\" content=\"2024-11-01T09:25:10+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2024-11-01T10:58:18+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\/34178\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/atmokpo.com\/w\/34178\/\"},\"author\":{\"name\":\"root\",\"@id\":\"https:\/\/atmokpo.com\/w\/#\/schema\/person\/91b6b3b138fbba0efb4ae64b1abd81d7\"},\"headline\":\"C++ Coding Test Course, Counting the Number of Leaf Nodes\",\"datePublished\":\"2024-11-01T09:25:10+00:00\",\"dateModified\":\"2024-11-01T10:58:18+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/atmokpo.com\/w\/34178\/\"},\"wordCount\":448,\"publisher\":{\"@id\":\"https:\/\/atmokpo.com\/w\/#organization\"},\"articleSection\":[\"C++ Coding Test Tutorials\"],\"inLanguage\":\"ko-KR\"},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/atmokpo.com\/w\/34178\/\",\"url\":\"https:\/\/atmokpo.com\/w\/34178\/\",\"name\":\"C++ Coding Test Course, Counting the Number of Leaf Nodes - \ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8\",\"isPartOf\":{\"@id\":\"https:\/\/atmokpo.com\/w\/#website\"},\"datePublished\":\"2024-11-01T09:25:10+00:00\",\"dateModified\":\"2024-11-01T10:58:18+00:00\",\"breadcrumb\":{\"@id\":\"https:\/\/atmokpo.com\/w\/34178\/#breadcrumb\"},\"inLanguage\":\"ko-KR\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/atmokpo.com\/w\/34178\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/atmokpo.com\/w\/34178\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"\ud648\",\"item\":\"https:\/\/atmokpo.com\/w\/en\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"C++ Coding Test Course, Counting the Number of Leaf Nodes\"}]},{\"@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_head_json":{"title":"C++ Coding Test Course, Counting the Number of Leaf Nodes - \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\/34178\/","og_locale":"ko_KR","og_type":"article","og_title":"C++ Coding Test Course, Counting the Number of Leaf Nodes - \ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8","og_description":"This article will explain in detail how to count the number of leaf nodes using the C++ programming language. It is structured to be easily understandable from start to finish, including the process of solving the algorithm problem and the code. Problem Description A leaf node refers to a node that has no child nodes. … \ub354 \ubcf4\uae30 \"C++ Coding Test Course, Counting the Number of Leaf Nodes\"","og_url":"https:\/\/atmokpo.com\/w\/34178\/","og_site_name":"\ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8","article_published_time":"2024-11-01T09:25:10+00:00","article_modified_time":"2024-11-01T10:58:18+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\/34178\/#article","isPartOf":{"@id":"https:\/\/atmokpo.com\/w\/34178\/"},"author":{"name":"root","@id":"https:\/\/atmokpo.com\/w\/#\/schema\/person\/91b6b3b138fbba0efb4ae64b1abd81d7"},"headline":"C++ Coding Test Course, Counting the Number of Leaf Nodes","datePublished":"2024-11-01T09:25:10+00:00","dateModified":"2024-11-01T10:58:18+00:00","mainEntityOfPage":{"@id":"https:\/\/atmokpo.com\/w\/34178\/"},"wordCount":448,"publisher":{"@id":"https:\/\/atmokpo.com\/w\/#organization"},"articleSection":["C++ Coding Test Tutorials"],"inLanguage":"ko-KR"},{"@type":"WebPage","@id":"https:\/\/atmokpo.com\/w\/34178\/","url":"https:\/\/atmokpo.com\/w\/34178\/","name":"C++ Coding Test Course, Counting the Number of Leaf Nodes - \ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8","isPartOf":{"@id":"https:\/\/atmokpo.com\/w\/#website"},"datePublished":"2024-11-01T09:25:10+00:00","dateModified":"2024-11-01T10:58:18+00:00","breadcrumb":{"@id":"https:\/\/atmokpo.com\/w\/34178\/#breadcrumb"},"inLanguage":"ko-KR","potentialAction":[{"@type":"ReadAction","target":["https:\/\/atmokpo.com\/w\/34178\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/atmokpo.com\/w\/34178\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"\ud648","item":"https:\/\/atmokpo.com\/w\/en\/"},{"@type":"ListItem","position":2,"name":"C++ Coding Test Course, Counting the Number of Leaf Nodes"}]},{"@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\/34178","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=34178"}],"version-history":[{"count":1,"href":"https:\/\/atmokpo.com\/w\/wp-json\/wp\/v2\/posts\/34178\/revisions"}],"predecessor-version":[{"id":34179,"href":"https:\/\/atmokpo.com\/w\/wp-json\/wp\/v2\/posts\/34178\/revisions\/34179"}],"wp:attachment":[{"href":"https:\/\/atmokpo.com\/w\/wp-json\/wp\/v2\/media?parent=34178"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/atmokpo.com\/w\/wp-json\/wp\/v2\/categories?post=34178"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/atmokpo.com\/w\/wp-json\/wp\/v2\/tags?post=34178"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}

{"id":34178,"date":"2024-11-01T09:25:10","date_gmt":"2024-11-01T09:25:10","guid":{"rendered":"http:\/\/atmokpo.com\/w\/?p=34178"},"modified":"2024-11-01T10:58:18","modified_gmt":"2024-11-01T10:58:18","slug":"c-coding-test-course-counting-the-number-of-leaf-nodes-2","status":"publish","type":"post","link":"https:\/\/atmokpo.com\/w\/34178\/","title":{"rendered":"C++ Coding Test Course, Counting the Number of Leaf Nodes"},"content":{"rendered":"

<\/p>\n

This article will explain in detail how to count the number of leaf nodes using the C++ programming language. It is structured to be easily understandable from start to finish, including the process of solving the algorithm problem and the code.<\/p>\n

Problem Description<\/h2>\n
A leaf node refers to a node that has no child nodes. Write a program to count the number of leaf nodes in a given binary tree. The input for this problem will be the root node of the binary tree.<\/p>\n

Input format:<\/h3>\n

The root node of the binary tree (the root node may be nullptr.)<\/li>\n<\/ul>\n

Output format:<\/h3>\n

The number of leaf nodes<\/li>\n<\/ul>\n

Algorithm Approach<\/h2>\n
To solve this problem, we will traverse the binary tree recursively. Each time we visit a node, we check if it is a leaf node. A leaf node has no child nodes, so we simply need to check if both the left and right child nodes are nullptr.<\/p>\n

Specific Algorithm:<\/h3>\n

If the root node is nullptr, return 0.<\/li>\n
If the node is a leaf node, return 1.<\/li>\n

Recursively traverse the left and right subtrees, summing and returning the results.<\/li>\n<\/ol>\n

C++ Code Implementation<\/h2>\n

Now let’s take a look at the code that implements the above algorithm in C++.<\/p>\n

\n#include <iostream>\n\nstruct TreeNode {\n    int val;\n    TreeNode *left;\n    TreeNode *right;\n    \n    TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}\n};\n\nint countLeafNodes(TreeNode* root) {\n    \/\/ 1. If the root is nullptr\n    if (root == nullptr) {\n        return 0;\n    }\n    \n    \/\/ 2. If it is a leaf node\n    if (root->left == nullptr && root->right == nullptr) {\n        return 1;\n    }\n    \n    \/\/ 3. Explore the left and right subtrees\n    return countLeafNodes(root->left) + countLeafNodes(root->right);\n}\n\nint main() {\n    \/\/ Create a binary tree for testing\n    TreeNode* 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    \n    \/\/ Print the number of leaf nodes\n    int leafCount = countLeafNodes(root);\n    std::cout << \"Number of leaf nodes: \" << leafCount << std::endl;\n    \n    \/\/ Free allocated memory\n    delete root->left->left;\n    delete root->left->right;\n    delete root->left;\n    delete root->right;\n    delete root;\n\n    return 0;\n}\n<\/code><\/pre>\nCode Explanation<\/h2>\nThe code above implements the countLeafNodes<\/code> function, which takes the root node of a binary tree and returns the number of leaf nodes.<\/p>\n
Struct Declaration:<\/h3>\nThe TreeNode<\/code> struct represents each node in the binary tree. Each node has an integer value (val<\/code>) and pointers to the left child (left<\/code>) and right child (right<\/code>).<\/p>\n
Counting Leaf Nodes:<\/h3>\nThe countLeafNodes<\/code> function first checks if the root is nullptr. If nullptr, it returns 0, and if it’s a leaf node, it returns 1. Otherwise, it recursively calls the left and right subtrees to count and sum the number of leaf nodes.<\/p>\n
Main Function:<\/h3>\nThe main function creates a binary tree for testing purposes and prints the number of leaf nodes corresponding to it. Finally, it is important to free the allocated memory.<\/p>\n
Testing and Results<\/h2>\nExecuting this code will yield the following result:<\/p>\n
\nNumber of leaf nodes: 3<\/p>\n<\/blockquote>\n
In the above binary tree, the leaf nodes are nodes 4, 5, and 3, resulting in a total of 3 leaf nodes.<\/p>\n
Conclusion<\/h2>\nIn this article, we explained how to count the number of leaf nodes in a binary tree using C++. Through examples of understanding and implementing algorithms, we can learn the basic recursive calls and struct usage in C++. To solve algorithm problems, it is important to break down the problem and approach it step by step. We hope you continue to practice various problems to build your algorithm skills.<\/p>\n
References<\/h2>\n\nC++ Reference<\/a><\/li>\n
LeetCode<\/a><\/li>\n
HackerRank C++ Tutorials<\/a><\/li>\n<\/ul>\n<\/body><\/p>\n","protected":false},"excerpt":{"rendered":"This article will explain in detail how to count the number of leaf nodes using the C++ programming language. It is structured to be easily understandable from start to finish, including the process of solving the algorithm problem and the code. Problem Description A leaf node refers to a node that has no child nodes. … \ub354 \ubcf4\uae30 “C++ Coding Test Course, Counting the Number of Leaf Nodes”<\/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":[111],"tags":[],"class_list":["post-34178","post","type-post","status-publish","format-standard","hentry","category-c-coding-test-tutorials-2"],"yoast_head":"\nC++ Coding Test Course, Counting the Number of Leaf Nodes - \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\/34178\/\" \/>\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, Counting the Number of Leaf Nodes - \ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8\" \/>\n<meta property=\"og:description\" content=\"This article will explain in detail how to count the number of leaf nodes using the C++ programming language. It is structured to be easily understandable from start to finish, including the process of solving the algorithm problem and the code. Problem Description A leaf node refers to a node that has no child nodes. … \ub354 \ubcf4\uae30 "C++ Coding Test Course, Counting the Number of Leaf Nodes"\" \/>\n<meta property=\"og:url\" content=\"https:\/\/atmokpo.com\/w\/34178\/\" \/>\n<meta property=\"og:site_name\" content=\"\ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8\" \/>\n<meta property=\"article:published_time\" content=\"2024-11-01T09:25:10+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2024-11-01T10:58:18+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\/34178\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/atmokpo.com\/w\/34178\/\"},\"author\":{\"name\":\"root\",\"@id\":\"https:\/\/atmokpo.com\/w\/#\/schema\/person\/91b6b3b138fbba0efb4ae64b1abd81d7\"},\"headline\":\"C++ Coding Test Course, Counting the Number of Leaf Nodes\",\"datePublished\":\"2024-11-01T09:25:10+00:00\",\"dateModified\":\"2024-11-01T10:58:18+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/atmokpo.com\/w\/34178\/\"},\"wordCount\":448,\"publisher\":{\"@id\":\"https:\/\/atmokpo.com\/w\/#organization\"},\"articleSection\":[\"C++ Coding Test Tutorials\"],\"inLanguage\":\"ko-KR\"},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/atmokpo.com\/w\/34178\/\",\"url\":\"https:\/\/atmokpo.com\/w\/34178\/\",\"name\":\"C++ Coding Test Course, Counting the Number of Leaf Nodes - \ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8\",\"isPartOf\":{\"@id\":\"https:\/\/atmokpo.com\/w\/#website\"},\"datePublished\":\"2024-11-01T09:25:10+00:00\",\"dateModified\":\"2024-11-01T10:58:18+00:00\",\"breadcrumb\":{\"@id\":\"https:\/\/atmokpo.com\/w\/34178\/#breadcrumb\"},\"inLanguage\":\"ko-KR\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/atmokpo.com\/w\/34178\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/atmokpo.com\/w\/34178\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"\ud648\",\"item\":\"https:\/\/atmokpo.com\/w\/en\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"C++ Coding Test Course, Counting the Number of Leaf Nodes\"}]},{\"@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, Counting the Number of Leaf Nodes - \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\/34178\/","og_locale":"ko_KR","og_type":"article","og_title":"C++ Coding Test Course, Counting the Number of Leaf Nodes - \ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8","og_description":"This article will explain in detail how to count the number of leaf nodes using the C++ programming language. It is structured to be easily understandable from start to finish, including the process of solving the algorithm problem and the code. Problem Description A leaf node refers to a node that has no child nodes. … \ub354 \ubcf4\uae30 \"C++ Coding Test Course, Counting the Number of Leaf Nodes\"","og_url":"https:\/\/atmokpo.com\/w\/34178\/","og_site_name":"\ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8","article_published_time":"2024-11-01T09:25:10+00:00","article_modified_time":"2024-11-01T10:58:18+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\/34178\/#article","isPartOf":{"@id":"https:\/\/atmokpo.com\/w\/34178\/"},"author":{"name":"root","@id":"https:\/\/atmokpo.com\/w\/#\/schema\/person\/91b6b3b138fbba0efb4ae64b1abd81d7"},"headline":"C++ Coding Test Course, Counting the Number of Leaf Nodes","datePublished":"2024-11-01T09:25:10+00:00","dateModified":"2024-11-01T10:58:18+00:00","mainEntityOfPage":{"@id":"https:\/\/atmokpo.com\/w\/34178\/"},"wordCount":448,"publisher":{"@id":"https:\/\/atmokpo.com\/w\/#organization"},"articleSection":["C++ Coding Test Tutorials"],"inLanguage":"ko-KR"},{"@type":"WebPage","@id":"https:\/\/atmokpo.com\/w\/34178\/","url":"https:\/\/atmokpo.com\/w\/34178\/","name":"C++ Coding Test Course, Counting the Number of Leaf Nodes - \ub77c\uc774\ube0c\uc2a4\ub9c8\ud2b8","isPartOf":{"@id":"https:\/\/atmokpo.com\/w\/#website"},"datePublished":"2024-11-01T09:25:10+00:00","dateModified":"2024-11-01T10:58:18+00:00","breadcrumb":{"@id":"https:\/\/atmokpo.com\/w\/34178\/#breadcrumb"},"inLanguage":"ko-KR","potentialAction":[{"@type":"ReadAction","target":["https:\/\/atmokpo.com\/w\/34178\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/atmokpo.com\/w\/34178\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"\ud648","item":"https:\/\/atmokpo.com\/w\/en\/"},{"@type":"ListItem","position":2,"name":"C++ Coding Test Course, Counting the Number of Leaf Nodes"}]},{"@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\/34178","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=34178"}],"version-history":[{"count":1,"href":"https:\/\/atmokpo.com\/w\/wp-json\/wp\/v2\/posts\/34178\/revisions"}],"predecessor-version":[{"id":34179,"href":"https:\/\/atmokpo.com\/w\/wp-json\/wp\/v2\/posts\/34178\/revisions\/34179"}],"wp:attachment":[{"href":"https:\/\/atmokpo.com\/w\/wp-json\/wp\/v2\/media?parent=34178"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/atmokpo.com\/w\/wp-json\/wp\/v2\/categories?post=34178"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/atmokpo.com\/w\/wp-json\/wp\/v2\/tags?post=34178"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}

Problem Description<\/h2>\nA leaf node refers to a node that has no child nodes. Write a program to count the number of leaf nodes in a given binary tree. The input for this problem will be the root node of the binary tree.<\/p>\n

Algorithm Approach<\/h2>\nTo solve this problem, we will traverse the binary tree recursively. Each time we visit a node, we check if it is a leaf node. A leaf node has no child nodes, so we simply need to check if both the left and right child nodes are nullptr.<\/p>\n

Code Explanation<\/h2>\nThe code above implements the countLeafNodes<\/code> function, which takes the root node of a binary tree and returns the number of leaf nodes.<\/p>\n

Problem Description<\/h2>\n
A leaf node refers to a node that has no child nodes. Write a program to count the number of leaf nodes in a given binary tree. The input for this problem will be the root node of the binary tree.<\/p>\n

Algorithm Approach<\/h2>\n
To solve this problem, we will traverse the binary tree recursively. Each time we visit a node, we check if it is a leaf node. A leaf node has no child nodes, so we simply need to check if both the left and right child nodes are nullptr.<\/p>\n

Code Explanation<\/h2>\n
The code above implements the `countLeafNodes<\/code> function, which takes the root node of a binary tree and returns the number of leaf nodes.<\/p>\n`