Esempio n. 1
0
	def test_find_min(self):
		emptyTree = BSTree()
		self.assertEqual(emptyTree.findMin(emptyTree.root), -1)
		tree = self.makeTree()
		self.assertEqual(tree.findMin(tree.root).data,10)
		three = tree.root.left
		self.assertEqual(tree.findMin(three).data,4)
Esempio n. 2
0
	def test_search(self):
		tree = BSTree(5)
		for kid in self.childs:
			tree.insert(kid)
		for kid in self.childs:
			self.assertTrue(tree.search(tree.root,kid))

		self.assertFalse(tree.search(tree.root,500))
		self.assertFalse(tree.search(tree.root,-1))
		self.assertFalse(tree.search(tree.root,'abc'))
		self.assertFalse(tree.search(tree.root,None))
Esempio n. 3
0
	def test_insert_left_child(self):
		tree = BSTree(5)
		tree.insert(3)
		self.assertIsInstance(tree.root.left, Node)
		self.assertEqual(tree.root.left.data,3)
		self.assertIsNone(tree.root.left.left)
Esempio n. 4
0
	def test_insert_left_grandchild(self):
		tree = BSTree(5)
		tree.insert(3)
		tree.insert(1)				
		self.assertEqual(tree.root.left.left.data,1)
		self.assertIsNone(tree.root.left.right)
Esempio n. 5
0
	def makeTree(self):
		tree = BSTree(5)
		for kid in self.childs:
			tree.insert(kid)
		return tree