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/add_row_tree.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/add_row_tree.cpp')
-rw-r--r-- | other/add_row_tree.cpp | 29 |
1 files changed, 0 insertions, 29 deletions
diff --git a/other/add_row_tree.cpp b/other/add_row_tree.cpp deleted file mode 100644 index 54ebfb4..0000000 --- a/other/add_row_tree.cpp +++ /dev/null @@ -1,29 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - TreeNode *addOneRow(TreeNode *root, int val, int depth) { - if (depth-- == 1) - return new TreeNode(val, root, nullptr); - queue<TreeNode *> q; - q.push(root); - while (!q.empty()) { - bool addLevel = depth-- == 1; - size_t sz = q.size(); - for (size_t _ = 0; _ < sz; _++) { - TreeNode *curr = q.front(); - q.pop(); - if (addLevel) { - curr->left = new TreeNode(val, curr->left, nullptr); - curr->right = new TreeNode(val, nullptr, curr->right); - continue; - } - if (curr->left) - q.push(curr->left); - if (curr->right) - q.push(curr->right); - } - } - return root; - } -}; |