def __init__(self, name):
self.name = name
self.customers = hashtable.Hashtable()
self.classicals = binarysearchtree.BinarySearchTree()
self.rocks = binarysearchtree.BinarySearchTree()
self.metals = binarysearchtree.BinarySearchTree()
self.fact = factory.Factory()
def testchildren(self):
Tree = b.BinarySearchTree()
Tree.insert('DA3018', 7.5)
Tree["DA2004"] = 5
Tree["DA3020"] = 6
self.assertIsNotNone(Tree["DA2004"])
self.assertIsNotNone(Tree["DA2004"])
def test_min(self):
tree = bst.BinarySearchTree()
tree.add_value(2, 'b')
tree.add_value(1, "a")
tree.add_value(3, 'c')
node = tree.min()
self.assertEquals(1, node.key)
def testremoveroot(self):
Tree = b.BinarySearchTree()
Tree.insert('DA3018', 7.5)
Tree["DA2004"] = 5
Tree["DA3020"] = 6
Tree["DA3019"] = 6
Tree.remove("DA3018")
self.assertEqual(Tree.size(), 3)
def testGenerator(self):
Tree = b.BinarySearchTree()
Tree.insert('DA3018', 7.5)
Tree["DA2004"] = 5
Tree["DA3020"] = 6
fill = []
for a, c in Tree:
fill.append(a)
self.assertEqual(fill[0], "DA2004")
self.assertEqual(fill[1], "DA3018")
self.assertEqual(fill[2], "DA3020")
def test_put_simple_values(self):
tree = bst.BinarySearchTree()
tree.add_value(2, 'b')
tree.add_value(1, "a")
tree.add_value(3, 'c')
rootNode = tree.rootNode
self.assertEquals(3, rootNode.size())
node2 = tree.get(2)
self.assertEquals(node2, rootNode)
node1 = tree.get(1)
self.assertEquals(1, node1.size())
def test_construction(self):
tree = bst.BinarySearchTree()
tree.add_value(2, 'b')
tree.add_value(1, "a")
tree.add_value(4, 'c')
tree.add_value(3, 'd')
tree.add_value(7, 'e')
tree.add_value(5, 'f')
tree.add_value(8, 'g')
node4 = tree.get(4)
self.assertEquals(7, node4.right.key)
self.assertEquals(3, node4.left.key)
def test_delete(self):
tree = bst.BinarySearchTree()
tree.add_value(2, 'b')
tree.add_value(1, "a")
tree.add_value(4, 'c')
tree.add_value(3, 'd')
tree.add_value(7, 'e')
tree.add_value(5, 'f')
tree.add_value(8, 'g')
tree.print_tree()
self.assertEquals(2, tree.rootNode.key)
tree.delete(4)
tree.print_tree()
# Should be what replaced the node with key 4
node5 = tree.get(5)
self.assertEquals(3, node5.left.key)
self.assertEquals(7, node5.right.key)
def test_get_dont_exist(self):
tree = bst.BinarySearchTree()
tree.add_value(2, 'b')
node = tree.get(1)
self.assertIsNone(node)
def testcreatetree(self):
Tree = b.BinarySearchTree()
self.assertIsInstance(Tree, b.BinarySearchTree)
def testsize(self):
Tree = b.BinarySearchTree()
Tree.insert('DA3018', 7.5)
Tree["DA2004"] = 5
Tree["DA3020"] = 6
self.assertEqual(Tree.size(), 3)
def testinserttree(self):
Tree = b.BinarySearchTree()
Tree.insert('DA3018', 7.5)
self.assertIsInstance(Tree, b.BinarySearchTree)
self.assertEqual(Tree.find("DA3018"), 7.5)
import unittest
import binarysearchtree as bst
mytree = bst.BinarySearchTree()
mytree[2] = "red"
mytree[6] = "black"
mytree[4] = "purple"
mytree[1] = "blue"
mytree[5] = "orange"
mytree[3] = "pink"
mytree[3] = "silver"
mytree[3] = "brown"
class Test_binarysearchtree(unittest.TestCase):
def test_inOrder(self):
test_list = [1, 2, 3, 4, 5, 6]
self.assertEqual(mytree.inOrder(), test_list)
def test_root(self):
self.assertEqual(mytree.root.key, 2)
def test_size(self):
self.assertEqual(len(mytree), 6)
def test_override_key_value(self):
self.assertEqual(mytree[3], "brown")
if __name__ == '__main__':
unittest.main()
def setUp(self):
self.tree = binarysearchtree.BinarySearchTree()