建立一棵含有n个结点的二叉树，采用二叉链表存储, 前序（或中序、后序）遍历该二叉树。 -Create a binary tree with n nodes, using a binary linked list storage, pre-order (or sequence order) traversal of the binary tree.