二叉树前序、中序遍历得到后序遍历

二叉树的前序遍历为:{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

>>阅读原文<<