输入完全二叉树前序，实现中序、后序、层次遍历，交换左右子树，统计叶子节点，二叉树深度。使用C语言实现。-Enter the first complete binary tree sequence to achieve the sequence after sequence, hierarchy traversal, the exchange about the sub-tree leaf node statistics, binary tree depth. Using the C.