From cdd5b3b51b1b1913184c779da8d4432c3c8adc45 Mon Sep 17 00:00:00 2001
From: Deven <63876261+devenperez@users.noreply.github.com>
Date: Wed, 27 Nov 2024 12:37:43 -0500
Subject: [PATCH] Create README - LeetHub
---
.../README.md | 39 +++++++++++++++++++
1 file changed, 39 insertions(+)
create mode 100644 0114-flatten-binary-tree-to-linked-list/README.md
diff --git a/0114-flatten-binary-tree-to-linked-list/README.md b/0114-flatten-binary-tree-to-linked-list/README.md
new file mode 100644
index 0000000..581431b
--- /dev/null
+++ b/0114-flatten-binary-tree-to-linked-list/README.md
@@ -0,0 +1,39 @@
+Medium
Given the root of a binary tree, flatten the tree into a "linked list":
+
+
+ - The "linked list" should use the same
TreeNode class where the right child pointer points to the next node in the list and the left child pointer is always null.
+ - The "linked list" should be in the same order as a pre-order traversal of the binary tree.
+
+
+
+Example 1:
+
+
+Input: root = [1,2,5,3,4,null,6]
+Output: [1,null,2,null,3,null,4,null,5,null,6]
+
+
+Example 2:
+
+
+Input: root = []
+Output: []
+
+
+Example 3:
+
+
+Input: root = [0]
+Output: [0]
+
+
+
+Constraints:
+
+
+ - The number of nodes in the tree is in the range
[0, 2000].
+ -100 <= Node.val <= 100
+
+
+Follow up: Can you flatten the tree in-place (with O(1) extra space)?
\ No newline at end of file