1.递归yield使用: 嵌套列表展开 def flatten(nested): if type(nested)==list: for sublist in nested: for i in flatten(sublist): yield i else: yield nested print(list(flatten([[[1],2],3,4,[5,[6,7]],8]))) #结果为[1,2,3,4,5,6,7,8] 树的后序遍历: def postorderTraversal(self, ro…