diff options
author | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
commit | a96b65cbfad7f62f3db6b2eab105e4e25c0414c5 (patch) | |
tree | e2a2b3f49f9fb741be81415266ac93e74cff42ec /other/count_good_nodes_bst.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/count_good_nodes_bst.cpp')
-rw-r--r-- | other/count_good_nodes_bst.cpp | 22 |
1 files changed, 0 insertions, 22 deletions
diff --git a/other/count_good_nodes_bst.cpp b/other/count_good_nodes_bst.cpp deleted file mode 100644 index b6b9b3e..0000000 --- a/other/count_good_nodes_bst.cpp +++ /dev/null @@ -1,22 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - int goodNodes(TreeNode *root) { - dfs(root, root->val); - return count; - } - -private: - int count = 0; - void dfs(TreeNode *node, int currMax) { - if (!node) - return; - if (node->val >= currMax) { - count++; - currMax = node->val; - } - dfs(node->left, currMax); - dfs(node->right, currMax); - } -}; |