完成二叉树的基本算法，包括二叉树的生成（多种方式，先根、层次、双序列），遍历（前序、中序、层次等），求叶子节点数等-Completion of the basic binary tree algorithm, including the generation of binary tree (a variety of ways, first the root, level, two-sequence), traversal (pre-order, in sequence, level, etc.), find the leaf nodes, etc.