python 遍历列表后保存_递归后序遍历到Python中的列表？

可以传入可调用对象，也可以编写生成器：def postorder(T):

if T != None:

postorder(T.left)

postorder(T.right)

print T.data,

def postorder_func(T, f):

if T != None:

postorder_func(T.left, f)

postorder_func(T.right, f)

f(T.data)

def postorder_gen(T):

if T != None:

for i in postorder_gen(T.left):

yield i

for i in postorder_gen(T.right):

yield i

yield T.data

class T:

def __init__(self, left = None, data = None, right = None):

self.left = left

self.data = data

self.right = right

one_half = T(data=.5)

three_halves = T(data=1.5)

one = T(one_half, 1, three_halves)

three = T(data=3)

root = T(one, 2, three)

postorder(root)

print ""

a = []

postorder_func(root, a.append)

print a

a = list(postorder_gen(root))

print a

或者，一个单一的解决方案：def postorder_one(T):

return [] if T is None else postorder_one(T.left)+[T.data]+postorder_one(T.right)