实现二叉树的基本操作：建立、遍历、计算深度、结点数、叶子数等。-Binary tree basic operations: the establishment, traverse, calculate the depth, the number of nodes, number of leaves and the like.