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/check_complete_bt.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/check_complete_bt.cpp')
-rw-r--r-- | other/check_complete_bt.cpp | 26 |
1 files changed, 0 insertions, 26 deletions
diff --git a/other/check_complete_bt.cpp b/other/check_complete_bt.cpp deleted file mode 100644 index 4054423..0000000 --- a/other/check_complete_bt.cpp +++ /dev/null @@ -1,26 +0,0 @@ -// 958. Check Completeness of a Binary Tree -#include "leetcode.h" - -/* - * given 'root' of binary tree, determine if it is a complete binary tree. in a - * completely filled binary tree, every level, except possibly the last, is - * completely filled, and all nodes in the last level are as far left as - * possible. it can have between 1 and 2^h nodes inclusive at the last level h. - */ - -class Solution { -public: - bool isCompleteTree(TreeNode *root) { - vector<TreeNode *> bfs; - bfs.push_back(root); - int i = 0; - while (i < bfs.size() && bfs[i]) { - bfs.push_back(bfs[i]->left); - bfs.push_back(bfs[i]->right); - i++; - } - while (i < bfs.size() && !bfs[i]) - i++; - return i == bfs.size(); - } -}; |