安装
pip install PrettyPrintTree
导入
from PrettyPrint import PrettyPrintTree
树的定义
class TreeNode:
def __init__(self, val=None, left=None, right=None):
self.val = val
self.left = left
self.right = right
层序遍历,从列表转换为二叉树
def list2treeNode(lst):
def level(index):
if index >= len(lst) or lst[index] is None:
return None
root = TreeNode(lst[index])
root.left = level(index*2+1)
root.right = level(index*2+2)
return root
return level(0)
画出一个二叉树
#导入列表转二叉树的函数,Node是自己命名的一个py文件
from Node import list2treeNode
#导入画二叉树的包
from PrettyPrint import PrettyPrintTree
#列表、层序遍历的顺序:index是根节点,2*index+1和2*index+2是其两个子节点
lst = [3,9,20,None,None,15,7]
tree = list2treeNode(lst)
#第一个lambda是从左到右返回包含所有子节点的iterable,第二个lambda返回根节点的val
pt = PrettyPrintTree(
lambda x: [x for x in [x.left, x.right] if x is not None],
lambda x: x.val
)
pt(tree)