Array to Min-Heap with In-Order Traversal the same as the Array

createTree.py

# i/p = array of numbers
# create a binary tree such that each subtree is a min-heap and the inorder traversal // of the binary tree is same as the array provided

# [5, 7, 10, 8, 1, 4]

#                       1
#                     /    \
#                   5        4
#                     \
#                       7
#                         \
#                           8
#                         /
#                      10
                    
#node createTree(int arr[]);
# 1, 1, 1, 1, 1, 3, 4, 5, 3, 1
        
class BinaryNode():
    def __init__(self, val):
        self.val = val
        self.left = None
        self.right = None
        
def createTree(array_version):
    if array_version == None:
        return None
    else:
        sorted_array = sorted(array_version)
        min_node_in_array = BinaryNode(sorted_array[0])
        index_of_min_node = array_version.index(min_node_in_array.val)
        min_node_in_array.right = createTree(array_version[index_of_min_node+1:])
        min_node_in_array.left = createTree(array_version[:index_of_min_node])
        return min_node_in_array