创建二叉树，前序中序后序遍历二叉树，计算叶子结点树以及树的深度。(The two forked tree is created, and the two forked tree is traversed in the preorder of the preorder, and the leaf node tree and the depth of the tree are calculated.)