no message

Author: Partho Biswas

README.md

@@ -788,6 +788,7 @@ BFS, DFS, Dijkstra, Floyd–Warshall, Bellman-Ford, Kruskal, Prim's, Minimum Spa
 |03| [Iterative_In-order_Traversal](algoexpert.io/questions/Iterative_In-order_Traversal.md) | [Python](algoexpert.io/python/Iterative_In-order_Traversal.py) |
 |04| [Right_Sibling_Tree](algoexpert.io/questions/Right_Sibling_Tree.md) | [Python](algoexpert.io/python/Right_Sibling_Tree.py) |
 |05| [Branch_Sums](algoexpert.io/questions/Branch_Sums.md) | [Python](algoexpert.io/python/Branch_Sums.py) |
+|06| [Flatten_Binary_Tree](algoexpert.io/questions/Flatten_Binary_Tree.md) | [Python](algoexpert.io/python/Flatten_Binary_Tree.py) |
 
 </p>
 </details>

algoexpert.io/python/Flatten_Binary_Tree.py

@@ -0,0 +1,24 @@
+# This is the class of the input root. Do not edit it.
+class BinaryTree:
+    def __init__(self, value, left=None, right=None):
+        self.value = value
+        self.left = left
+        self.right = right
+
+def flattenBinaryTree(root):
+    iorderNodes = getNodesInOrder(root, [])
+    for i in range(0, len(iorderNodes) - 1):
+        leftNode = iorderNodes[i]
+        rightNode = iorderNodes[i + 1]
+        leftNode.right = rightNode
+        rightNode.left = leftNode
+    return iorderNodes[0]
+
+
+def getNodesInOrder(tree, array):
+    if tree is not None:
+        getNodesInOrder(tree.left, array)
+        array.append(tree)
+        getNodesInOrder(tree.right, array)
+    return array
+

algoexpert.io/python/Same_BSTs.py

@@ -0,0 +1,33 @@
+def sameBsts(arrayOne, arrayTwo):
+    if len(arrayOne) != len(arrayTwo):
+        return False
+
+    if len(arrayOne) == 0 and len(arrayTwo) == 0:
+        return True
+
+    if arrayOne[0] != arrayTwo[0]:
+        return False
+
+    leftOne = getSmaller(arrayOne)
+    leftTwo = getSmaller(arrayTwo)
+    rightOne = getBiggerOrEqual(arrayOne)
+    rightTwo = getBiggerOrEqual(arrayTwo)
+
+    return sameBsts(leftOne, leftTwo) and sameBsts(rightOne, rightTwo)
+
+
+def getSmaller(array):
+    smaller = []
+    for i in range(1, len(array)):
+        if array[i] < array[0]:
+            smaller.append(array[i])
+    return smaller
+
+
+def getBiggerOrEqual(array):
+    biggerOrEqual = []
+    for i in range(1, len(array)):
+        if array[i] >= array[0]:
+            biggerOrEqual.append(array[i])
+    return biggerOrEqual
+