def test_convert():
btree = BinTree()
btree.add(10)
btree.add(6)
btree.add(14)
btree.add(4)
btree.add(8)
btree.add(12)
btree.add(16)
convert(btree.root)
def test_find_path():
btree = BinTree()
btree.add(10)
btree.add(5)
btree.add(12)
btree.add(4)
btree.add(7)
find_path(btree.root, 22)
find_path(btree.root, 17)
def test_print_from_top_to_bottom():
# 空树
btree = BinTree()
print_from_top_to_bottom(btree.root)
# 单结点树
btree = BinTree()
btree.add(8)
print_from_top_to_bottom(btree.root)
# 多结点树
btree = BinTree()
btree.add(8)
btree.add(6)
btree.add(10)
btree.add(5)
btree.add(7)
btree.add(9)
# btree.add(11)
print_from_top_to_bottom(btree.root)
def test_mirror_use_stack():
# 空结点树
tree = BinTree()
print(mirror_use_stack(tree.root))
# 一个结点的树
tree = BinTree()
tree.add('A')
mirror_use_stack(tree.root)
tree.preorder_trav(tree.root)
# 多结点树
tree = BinTree()
tree.add('A')
tree.add('B')
tree.add('C')
tree.add('D')
tree.add('E')
tree.add('F')
tree.add('G')
print("-------------------镜像前-------------------")
tree.preorder_trav(tree.root)
mirror_use_stack(tree.root)
print("-------------------镜像后-------------------")
tree.preorder_trav(tree.root)
