实现对任意给定的二叉树（顶点数自定）建立它的二叉链表存贮结构，并利用栈的五种基本运算（置空栈、进栈、出栈、取栈顶元素、判栈空）实现二叉树的先序、中序、后序三种遍历，输出三种遍历的结果。-Any given realization of the binary tree (self-Vertices) the establishment of its chain store binary structure, and use the five basic computing stack (The s

线性表运算，进行插入、删除、返回长度、判空、等的10多种操作-Linear table operations, insertion, deletion, back length, sub-space, and so on more than 10 kinds of operations

双向栈操作，可以进行左插入，左删除，右插入，右删除，判空、计算长度等操作-Two-way stack operation, can be left to insert, remove the left and right insert, the right to delete, sub-space, length of operation of calculation

判空比较,那种判断方式最有效率，最快，最好-Is NULL

一字棋游戏是一个流传已久的传统游戏。游戏由两个人轮流来下，分别用“X”和“O”来代替自身的棋子。棋盘分9个格，双方可以在轮到自己下的时候，可以用棋子占领其中一个空的格子。如果双方中有一方的棋子可以连成一条直线，则这一方判胜，对方判负。当所有的格子都被占领，但双方都无法使棋子连成一条直线的话，则判和棋。(Word chess is a long tradition game. The game is played by two turns, each with its own "X&qu