Create 114. Flatten Binary Tree to Linked List

Author: khushi3004

Diff for: 114. Flatten Binary Tree to Linked List

@@ -0,0 +1,36 @@
+class Solution {
+    public void flatten(TreeNode root) {
+        if(root == null) return;
+        
+        TreeNode tempLeft = root.left;
+        TreeNode tempRight = root.right;
+        
+        root.left = null;
+        
+        flatten(tempLeft);
+        flatten(tempRight);
+        
+        root.right = tempLeft;
+        TreeNode current = root;
+        while(current.right != null) current = current.right;
+        current.right = tempRight;
+        
+    }
+}
+
+class Solution {
+    public void flatten(TreeNode root) {
+        if(root == null) return;
+        while(root != null){
+            if(root.left != null) {
+                TreeNode left = root.left;
+                TreeNode current = left;
+                while(current.right != null) current = current.right;
+                current.right = root.right;  // Morris Traversal main step
+                root.left =null;
+                root.right = left;
+            }
+            root = root.right;
+        }
+    }
+}