def testDFSRandom(): print(divider + "Executing testDFSRandom()...") tree = BinaryTree() expectedNodes = [32, 16, 2, 5, 12, 30, 18, 50, 48, 53] for number in randomNumbers: tree.insert(Node(number)) assert (tree.size == len(randomNumbers)) nodes = tree.getNodesDFS() print("Returned nodes = {}".format(nodesToString(nodes))) print("Expected nodes = {}".format([n for n in expectedNodes])) # Ensure that the order of the nodes is in the proper order for DFS for i in range(0, len(nodes)): assert (nodes[i].data == expectedNodes[i]) print("Passed" + divider)