python实现二叉树的中序遍历:#!/usr/bin/env python# coding=utf-8# inorderBL.pyimport stdinInputdef inorder(arrays,arraysize,currentP): if(2*currentP+1<arraysize): inorder(arrays,arraysize,2*currentP+1) print arrays[currentP] if(2*currentP+2<arraysize): inorder(ar