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/binary_tree_level_traverse.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/binary_tree_level_traverse.cpp')
-rw-r--r-- | other/binary_tree_level_traverse.cpp | 31 |
1 files changed, 0 insertions, 31 deletions
diff --git a/other/binary_tree_level_traverse.cpp b/other/binary_tree_level_traverse.cpp deleted file mode 100644 index 47a69da..0000000 --- a/other/binary_tree_level_traverse.cpp +++ /dev/null @@ -1,31 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - vector<vector<int>> levelOrder(TreeNode *root) { - vector<vector<int>> ans; - if (!root) - return ans; - queue<TreeNode *> q; - q.push(root); - q.push(NULL); - vector<int> curr; - while (!q.empty()) { - TreeNode *t = q.front(); - q.pop(); - if (t == NULL) { - ans.push_back(curr); - curr.resize(0); - if (q.size() > 0) - q.push(NULL); - } else { - curr.push_back(t->val); - if (t->left) - q.push(t->left); - if (t->right) - q.push(t->right); - } - } - return ans; - } -}; |