def testBreadthFirstTraversal(self):
bst = BinarySearchTree()
l = [8, 4, 2, 1, 3, 6, 5, 7, 12, 10, 9, 11, 14, 13, 15]
for d in l:
bst.insert(d)
expectedBFSOrder = [8, 4, 12, 2, 6, 10, 14, 1, 3, 5, 7, 9, 11, 13, 15]
gen = bst.bfsTraversal()
for expectedValue in expectedBFSOrder:
self.assertEqual(expectedValue, gen.next())
