Time: 0 ms (100.00%), Space: 9.7 MB (34.92%) - LeetHub

Author: ComputerScientist-01

invert-binary-tree/invert-binary-tree.cpp

@@ -0,0 +1,25 @@
+/**
+ * Definition for a binary tree node.
+ * struct TreeNode {
+ *     int val;
+ *     TreeNode *left;
+ *     TreeNode *right;
+ *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
+ *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
+ *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
+ * };
+ */
+class Solution {
+public:
+    TreeNode* invertTree(TreeNode* root) {
+        if(root)
+        {
+            invertTree(root->left);
+            invertTree(root->right);
+            std::swap(root->left,root->right);
+            
+        }
+        return root;
+        
+    }
+};