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_complete_tree_node.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/count_complete_tree_node.cpp')
-rw-r--r-- | other/count_complete_tree_node.cpp | 18 |
1 files changed, 0 insertions, 18 deletions
diff --git a/other/count_complete_tree_node.cpp b/other/count_complete_tree_node.cpp deleted file mode 100644 index 5929110..0000000 --- a/other/count_complete_tree_node.cpp +++ /dev/null @@ -1,18 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - int countNodes(TreeNode *root) { - if (!root) - return 0; - int l = 1, r = 1; - TreeNode *ptr_r = root, *ptr_l = root; - while (ptr_l = ptr_l->left) - l++; - while (ptr_r = ptr_r->right) - r++; - if (l == r) - return pow(2, l) - 1; - return 1 + countNodes(root->left) + countNodes(root->right); - } -}; |