def printTree(root):
if not root:
return
print("Binary Tree: ")
printInOrder(root, 0, 'H', 10)
def printInOrder(root, height, preStr, length):
if not root:
return
printInOrder(root.right, height+1, 'v', length)
string = preStr + root.val + preStr
leftLen = (length - len(string)) // 2
rightLen = length - len(string)- leftLen
res = " "*leftLen + string + " "*rightLen
print(" "*height*length + res)
printInOrder(root.left, height+1, '^', length)
二叉树问题---较为直观的打印二叉树
最新推荐文章于 2024-04-29 11:29:27 发布