def main():
lc1214 = LC1214_TwoSumBSTs()
BTUtils.printBT(lc1214.tree1())
#lc1214.test1()
lc1214.test2()
def testRemove2(self):
tree = BST(15).insert(14).insert(22).insert(21)
print("before remove")
Utils.printBT(tree)
ntr = 15
print("removing ", ntr)
tree.remove(ntr)
print("after remove")
Utils.printBT(tree)
def testContains1(self):
tree = BST(10).insert(1).insert(11)
Utils.printBT(tree)
r = tree.contains(9)
print("r: ", r)
tree2 = BST(10).insert(5).insert(15).insert(5).insert(2).insert(
14).insert(22)
Utils.printBT(tree2)
r2 = tree2.contains(2)
print("r2: ", r2)
def testRemove1(self):
tree2 = BST(10).insert(5).insert(15).insert(5).insert(2).insert(
14).insert(22)
Utils.printBT(tree2)
ntr = 10
print("before remove")
r2 = tree2.contains(ntr)
print("tree contains {}: {}".format(ntr, r2))
tree2.remove(ntr)
print("after remove")
Utils.printBT(tree2)
r3 = tree2.contains(ntr)
print("tree contains {}: {}".format(ntr, r3))
def test_invertBinaryTree():
tree = Prob.tree1()
Utils.printBT(tree)
Prob.invertBinaryTree(tree)
Utils.printBT(tree)
def tree6():
test6 = BST(10).insert(5).insert(15).insert(5).insert(2).insert(1).insert(22)
print("test6.left.right: ", test6.left.right.value)
test6.left.right.right = BST(11)
Utils.printBT(test6)
return test6
def testTree4(self):
tree = (BST(10).insert(5).insert(15).insert(22).insert(17).insert(
34).insert(7).insert(2).insert(5).insert(1).insert(35).insert(
27).insert(16).insert(30).remove(22).remove(17))
Utils.printBT(tree)
def testTree2(self):
tree = BST(10).insert(5).insert(7).insert(2).remove(10)
Utils.printBT(tree)
def testTree1(self):
test1 = BST(10).insert(5).insert(15).insert(5).insert(2).insert(
14).insert(22)
Utils.printBT(test1)
def testInsert1(self):
tree = BST(10).insert(1).insert(11)
Utils.printBT(tree)