二叉树的实现，包括前序、中序、后序和层次遍历，输出，计算叶子节点等函数。-Binary tree realization, including the former sequence, in order, after the traversal sequence and levels of output, computing functions, such as leaf nodes.