def test_findLeftMost(self): var = globalVar() #Contains variables for tree insertion bTree = BinaryTree() bTree.insert(value= var.p1) bTree.insert(value= var.p2) bTree.insert(value= var.p5) bTree.insert(value= var.p4) self.assertEqual(bTree.findLeftMost(bTree._root).value, var.p5) #The smallest value, ('AASE') bTree.insert(value= var.p6) bTree.insert(value= var.p3) self.assertEqual(bTree.findLeftMost(bTree._root).value, var.p6)
def test_insert(self): var = globalVar() #Contains variables for tree insertion bTree = BinaryTree() bTree.insert(value= var.p1) self.assertEqual(bTree._root.value, var.p1) bTree.insert(value=var.p2) self.assertEqual(bTree.findRightMost(bTree._root).value, var.p2) bTree.insert(value=var.p5) self.assertEqual(bTree.findLeftMost(bTree._root).value, var.p5 )