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/invert_binary_tree.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/invert_binary_tree.cpp')
-rw-r--r-- | other/invert_binary_tree.cpp | 26 |
1 files changed, 0 insertions, 26 deletions
diff --git a/other/invert_binary_tree.cpp b/other/invert_binary_tree.cpp deleted file mode 100644 index e8f0585..0000000 --- a/other/invert_binary_tree.cpp +++ /dev/null @@ -1,26 +0,0 @@ -// 226. Invert Binary Tree -#include "leetcode.h" - -// given 'root' of binary tree, invert the tree and return its root - -class Solution { -public: - TreeNode *invertTree(TreeNode *root) { - if (root == nullptr) - return root; - queue<TreeNode *> q; - q.push(root); - while (!q.empty()) { - TreeNode *node = q.front(); - q.pop(); - if (node->left != nullptr) - q.push(node->left); - if (node->right != nullptr) - q.push(node->right); - TreeNode *tmp = node->left; - node->left = node->right; - node->right = tmp; - } - return root; - } -}; |