def test_create_binary_search_tree_from_sorted_list(self) -> None:
bt = BinaryTree()
elements: List[int] = []
elements = [random.randrange(0, 1000) for _ in range(20)]
elements.sort()
print('Elements are {}'.format(elements))
bt.create_BST_from_sorted_array(elements)
#Inoder Traversal
node_list: List[Node] = bt.inorder_tree_traversal()
node_list_keys = [node.get_key() for node in node_list]
#checking elements are coming sorted after inorder traversal
print(
'Elements after inorder traversal are :{}'.format(node_list_keys))
self.assertEqual(elements, node_list_keys)
print('******************************************\n')
