比较全面的二叉树相关操作，先序建立，先、中、后序遍历，计算叶子结点个数，交换左右子树-More complete binary tree related operations, the establishment of the first order, first, during, and after traversing to calculate the number of leaf nodes, the exchange of left and right subtrees