二叉樹前序、中序遍歷得到後序遍歷

二叉樹的前序遍歷爲:{1,2,4,7,3,5,6,8}，中序遍歷爲:{4,7,2,1,5,3,8,6}，求後序遍歷 　     # -*- coding:utf-8 -*- class Node: def __init__(self, x): self.data = x self.lchild = None self.rchild = None class Solution: def __init

>>阅读原文<<