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

>>阅读原文<<