def testAscendingMassive(self):
random.seed(5)
startFlag = True
for i in range(200000):
randNum = random.randint(0, 1000)
if startFlag:
myTree = BinarySearchTree(randNum)
startFlag = False
else:
myTree.add(randNum)
handler = TreeHandler(myTree)
handler.traverseAscending(myTree)
sortedList = handler.values
startFlag = True
sortedFlag = True
for num in sortedList:
if startFlag:
prevNum = num
startFlag = False
else:
if prevNum > num:
sortedFlag = False
break
prevNum = num
self.assertTrue(sortedFlag)
def testAddRight1Layer(self):
expected = BinarySearchTree(6)
myTree = BinarySearchTree(5)
actual = myTree.add(6)
self.assertEqual(expected, actual)
def testTraverseAscendingIterative1(self):
expected = [1, 2, 3]
myTree = BinarySearchTree(2)
myTree.add(1)
myTree.add(3)
handler = TreeHandler(myTree)
handler.traverseAscendingIterative()
actual = handler.values
self.assertEqual(expected, actual)
def testTraverseDescending1(self):
expected = [3, 2, 1]
myTree = BinarySearchTree(2)
myTree.add(1)
myTree.add(3)
handler = TreeHandler(myTree)
handler.traverseDescending(handler.root)
actual = handler.values
self.assertEqual(expected, actual)
def testAddLeft2Layer(self):
expected = BinarySearchTree(3)
myTree = BinarySearchTree(5)
myTree.add(4)
actual = myTree.add(3)
self.assertEqual(expected, actual)
def testTraverseDescendingIterative2(self):
expected = [6, 5, 4, 3, 2, 1]
myTree = BinarySearchTree(3)
myTree.add(1)
myTree.add(6)
myTree.add(2)
myTree.add(4)
myTree.add(5)
handler = TreeHandler(myTree)
handler.traverseDescendingIterative()
actual = handler.values
self.assertEqual(expected, actual)
def testTraverseAscending2(self):
expected = [1, 2, 3, 4, 5, 6]
myTree = BinarySearchTree(3)
myTree.add(1)
myTree.add(6)
myTree.add(2)
myTree.add(4)
myTree.add(5)
handler = TreeHandler(myTree)
handler.traverseAscending(handler.root)
actual = handler.values
self.assertEqual(expected, actual)