由二叉树的遍历序列返回二叉树

Returning to the binary tree from its traversing sequence

介绍了如何由二叉树的遍历序列返回一棵二叉树，并提供了一种简单、直观的图解方法，可作为二叉树遍历内容的补充。

In this paper,how to returning to the binary tree from its traversing sequence is introduced,and gives out a simple and direct diagram method.This paper can be used as a supplement to the traversing binary tree.