二叉树的先序、中序、后序、层次遍历；已知前序中序，后序中序构造树

先序：12478536
中序：74825163
后序：78452631

# -*- coding: utf-8 -*-
"""
Created on Mon Dec 10 09:57:46 2018

@author: 大茄茄
"""

class BinaryTree:
    
    def __init__(self, x, left=None, right=None):
        self.data = x
        self.left = left
        self.right = right
        
class BinaryTreeOrder:
    
    def preOrderRec(self, root):
        if root == None:
            return
        print(root.data, end=' ')
        self.preOrderRec(root.left)
        self.preOrderRec(root.right)
        
    def inOrderRec(self, root):
        if root == None:
            return
        self.inOrderRec(root.left)
        print(root.data, end=' ')
        self.inOrderRec(root.right)
        
    def postOrderRec(self, root):
        if root == N