要求采用二叉链表作为存储结构，完成二叉树的建立，前序、中序和后序遍历的操作，求所有叶子及结点总数的操作等。具体实现要求：分别利用前序遍历、中序遍历、后序遍历所建二叉树。-Requires a list as a binary storage structure, the establishment of complete binary tree, the first order, the order and post order traversal of the operation, find all the leaf nodes and the total number of operation. Specific implementation requirements: the use of pre-order traversal, respectively, in-order traversal, built post-order traversal binary tree.