二叉树的递归以及非递归创建，遍历，遍历包括前序.中序.后序.....，在其非递归创建和遍历时又分别利用了栈和队列等一系列方法进行-Recursive binary tree non-recursive traversal, as well as create, including the former sequence traversal sequence after sequence. .....

本实例实现了二叉树相关的一系列算法，包括建立二叉树、二叉树的前序、中序和后序遍历、统计数的结点数和叶子结点数。-The examples of the binary tree algorithm, including the establishment of a binary tree, binary tree preorder, inorder, and postorder traversal, statistical number of nodes and leaf nodes.

用二叉链表存储二叉树，用“扩张先序遍历序列”创建二叉链表，对二叉树进行前、中、后序的遍历以及层次遍历，输出度为0、1、2的节点及节点数，线索化二叉树，根据线索化的二叉树查找二叉树中任意节点的前驱、后继，通过线索二叉树进行二叉树节点的删除、插入，以及按树状打印二叉树。-Used to store binary tree binary tree, use the " expansion preorder sequence" to create the binary tree, th