using namespace insufficient_nodes_in_root_to_leaf_paths;

Author: masx200

insufficient-nodes-in-root-to-leaf-paths/index.hpp

@@ -1,42 +1,38 @@
 // +build ignore
 
 #pragma once
-/**
- * Definition for a binary tree node.
- * struct TreeNode {
- *     int val;
- *     TreeNode *left;
- *     TreeNode *right;
- *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
- * };
- */
-
-// #include "../insert-into-a-binary-search-tree/TreeNode.hpp"
+
 import leetcode_treenode_cpp.TreeNode;
 using namespace leetcode_treenode_cpp;
-class Solution {
-public:
-    TreeNode* sufficientSubset(TreeNode* root, int limit)
+
+namespace insufficient_nodes_in_root_to_leaf_paths
+{
+    class Solution
     {
+    public:
+        TreeNode *sufficientSubset(TreeNode *root, int limit)
+        {
 
-        if (!root)
-            return root;
+            if (!root)
+                return root;
 
-        if (!root->left && !root->right) {
+            if (!root->left && !root->right)
+            {
 
-            if (root->val >= limit)
-                return root;
+                if (root->val >= limit)
+                    return root;
 
-            else
-                return nullptr;
-        }
+                else
+                    return nullptr;
+            }
 
-        root->left = sufficientSubset(root->left, limit - root->val);
-        root->right = sufficientSubset(root->right, limit - root->val);
+            root->left = sufficientSubset(root->left, limit - root->val);
+            root->right = sufficientSubset(root->right, limit - root->val);
 
-        if (!root->left && !root->right)
-            return nullptr;
-        else
-            return root;
-    }
-};
+            if (!root->left && !root->right)
+                return nullptr;
+            else
+                return root;
+        }
+    };
+}

insufficient-nodes-in-root-to-leaf-paths/test.cpp

@@ -14,6 +14,8 @@ using namespace leetcode_treenode_cpp;
 import leetcode_treenode_cpp.traversalTreeNode;
 import leetcode_treenode_cpp.LeetCodeTreeNodeToString;
 import leetcode_treenode_cpp.parseLeetCodeBinaryTree;
+
+using namespace insufficient_nodes_in_root_to_leaf_paths;
 void LeetCode1080TestExamples(std::string& root, int limit, std::string& output)
 {
     TreeNode* tree = nullptr;