def testSum(self):
l = [-15, 5, 6, -8, 1, 3, 9, 2, 6, None, None, None, None, 4, 0, None, None, None, None, None, None, None, -1, 10, None]
s = 0
for v in l:
if v: s += v
bt = BinaryTree()
bt.create(l)
self.assertEqual(bt.sum(), s)
bstTwo = BinarySearchTree()
l = [8, 2, 1, 4, 5, 3, 9, 10, 15, 13, 12, 14, 18]
for v in l:
bstTwo.insert(v)
self.assertEqual(bstTwo.sum(), sum(l))
