aboutsummaryrefslogtreecommitdiff
path: root/other/invert_binary_tree.cpp
diff options
context:
space:
mode:
authorJack Sangdahl <[email protected]>2025-03-10 00:36:13 -0600
committerJack Sangdahl <[email protected]>2025-03-10 00:36:13 -0600
commit7c60dee83b436e8e8a667bf9f191beced8de4fc3 (patch)
treeeb7a24ee2067f92245c57bb118e85a1baf15df50 /other/invert_binary_tree.cpp
parent5d7cdc215e4ba1ec4cbb24c084cccb5e5e641468 (diff)
downloadleetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.tar.gz
leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.zip
chore: move cpp and rust code to directory
Diffstat (limited to 'other/invert_binary_tree.cpp')
-rw-r--r--other/invert_binary_tree.cpp26
1 files changed, 26 insertions, 0 deletions
diff --git a/other/invert_binary_tree.cpp b/other/invert_binary_tree.cpp
new file mode 100644
index 0000000..e8f0585
--- /dev/null
+++ b/other/invert_binary_tree.cpp
@@ -0,0 +1,26 @@
+// 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;
+ }
+};