二叉树的基本操作（1）在二叉链表上设计和实现下列二叉树运算的算法

① 设计递归算法，实现：删除二叉树，求二叉树的高度，求二叉树中叶子结点数，复制二叉树，交换二叉树的左右子树。

② 设计算法，按自上到下，自左向右的次序，即按层次遍历一棵二叉树。

③ 设计main函数，测试上述每个运算。

-Binary Tree s basic operations (1) in the binary list on the design and realization of the following binary tree algorithm for computing the design ① recursive algorithm: Remove binary tree, and tree height, for binary tree in leaf nodes, copy the binary tree, exchanging left and right subtree tree. ② design algorithm, since by the next, since the left-to-right order, that is, according to the level of a binary tree traversal. ③ main function of the design, testing each of the above calculations.