python实现二叉树的相关算法(持续更新)

定义树结构node class Tree(object): def __init__(self,val): self.val = val self.right = None self.left = None 前序遍历python def pre_iter(node): if not node: return p

>>阅读原文<<