构造二叉树，并求叶子节点的个数和该二叉树的深度。-Construct a binary tree, and find the number of leaf nodes and the binary tree of depth.

二叉树的操作，程序采用递归可进行树的遍历，求叶子节点的个数，交换左右子树等操作-Binary operation, the procedure can be carried out using recursive tree traversal, and the number of leaf nodes, exchange and other operations around subtree

二叉树的链式存储,以及使用链式存储统计叶子结点个数-Binary tree chain store, chain store statistics and the use of the number of leaf nodes

树的相关操作，先序遍历建立二叉链表，左右孩子交换，二叉树中叶子节点个数算法，统计以值为x的结点为根的子树中叶子结点的数目，按树状打印二叉树-Tree-related operations, first traversal establishment of binary list, so the child exchange, the number of leaf nodes in a binary tree algorithm, the statistical value of x to a n