二叉树的基本操作（1）在二叉链表上设计和实现下列二叉树运算的算法 ① 设计递归算法，实现：删除二叉树，求二叉树的高度，求二叉树中叶子结点数，复制二叉树，交换二叉树的左右子树。 ② 设计算法，按自上到下，自左向右的次序，即按层次遍历一棵二叉树。-The basic operation of a binary tree (1) the design and implementation of the following binary operation on the binary tree algorithm ① recursive algorithm designed to achieve: Remove binary tree, find the height of a binary tree, binary tree in leaf nodes, copy the binary tree, binary exchange about child tree. ② design algorithms, from top to bottom by, from left to right order, ie a binary tree traversal hierarchy.