def test_left_linked_list():
tree = TreeNode(2)
tree.insert(1)
tree.insert(0)
assert tree.balance() == 2
tree = tree.rebalance(tree)
assert tree.balance() == 0
treelist = [n for n in tree.depth_traversal("in")]
assert treelist == [0, 1, 2]
