我正在尝试结合递归和 yield 以按顺序遍历一棵树
这就是我目前拥有的。但是,当我尝试遍历树时,它似乎只遍历了根节点
class Tree:
...
def post_order(self, node: TreeNode):
"""Yield next node in post order from node"""
for child in node.get_children():
self.post_order(child)
yield node
if __name__ == '__main__':
root = TreeNode('root')
depth1a = TreeNode('1a')
depth1b = TreeNode('1b')
root.add_children(depth1a, depth1b)
tree = Tree(root)
for node in tree.post_order(root):
print(node.get_element())
当我运行代码时,它只打印出来
root
哪个是第一个节点的元素,不是我想要哪个是
1a
1b
root
有谁知道我做错了什么吗?
谢谢大家
请您参考如下方法:
感谢张实唯 ,原来我必须使用 yield from。调用生成器函数不会从中产生:
class Tree:
...
def post_order(self, node: TreeNode):
"""Yield next node in post order from node"""
for child in node.get_children():
yield from self.post_order(child)
yield node
