def test_binary_tree(N):
t = BinaryTree()
for i in range(int(N / 2)):
t.append_left(i)
for i in range(int(N / 2)):
t.append_right(int(N / 2) + i)
print_tree(t.root)
def test_binary_tree(N):
t = BinaryTree()
for i in range(int(N / 2)):
t.append_left(i)
for i in range(int(N / 2)):
t.append_right(int(N / 2) + i)
print_tree(t.root)
