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/n_ary_tree_traverse.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/n_ary_tree_traverse.cpp')
-rw-r--r-- | other/n_ary_tree_traverse.cpp | 25 |
1 files changed, 0 insertions, 25 deletions
diff --git a/other/n_ary_tree_traverse.cpp b/other/n_ary_tree_traverse.cpp deleted file mode 100644 index 9c89682..0000000 --- a/other/n_ary_tree_traverse.cpp +++ /dev/null @@ -1,25 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - vvd levelOrder(Node *root) { - vvd ans; - if (!root) - return ans; - queue<Node *> q; - q.push(root); - while (!q.empty()) { - int n = q.size(); - vector<int> v; - while (n--) { - auto curr = q.front(); - q.pop(); - v.push_back(curr->val); - for (auto it : curr->children) - q.push(it); - } - ans.push_back(v); - } - return ans; - } -}; |