编程实现二叉树的存储结构与基本算法，主要包括以下功能：

 　　创建二叉树B的二叉链

二叉树B：A(B(D,E(H(J,K(L,M(,N))))),C(F,G(,I)))

















 　　通过对二叉树B的操作，输出二叉树B的广义表（字符串）表达式

 　　通过对二叉树B的操作，输出H结点的左孩子与右孩子

 　　通过对二叉树B的操作，出二叉树B的深度

 　　通过对二叉树B的操作，计算出二叉树B的结点个数

 　　通过对二叉树B的操作，计算出二叉树B的叶子结点个数

 　　通过对二叉树B的操作，输出二叉树B的先序遍历序列

 　　通过对二叉树B的操作，输出二叉树B的中序遍历序列

 　　通过对二叉树B的操作，输出二叉树B的后序遍历序列

 　　释放二叉树B-Programming storage structure and basic algorithms binary tree, including the following features: 　create binary chain binary B binary B' s: A (B (D, E (H (J, K (L, M (, N)))) ), C (F, G (, I))) 　B through binary operation generalized table output binary tree B (strings) by binary expression 　B operation, the output of H nodes left child and right children 　B through binary operation, the depth of a binary tree B B 　through binary operation to calculate the number of nodes of a binary tree B B 　through binary operation to calculate the number of leaf nodes of the binary tree B 　by binary tree B operation, first order output binary tree B traversal sequence 　through the binary tree B operation, the output of a binary tree B of traversal sequence 　through the binary tree B operation, after the sequence output binary tree B traversal sequence 　release binary Tree B