对任意给定的二叉树（顶点数自定）建立它的二叉链表存贮结构，并利用栈的五种基本运算实现二叉树的先序、中序、后序三种遍历，输出三种遍历的结果。-For any given tree (self-Vertices) the establishment of its binary linked list storage structure, and use five basic computing stack to achieve the first order binary tree, in order, after three traversal sequence , the output of three ergodic results.