2 编写将一棵二叉树的所有左右子树进行交换的算法。 提示：验证是否交换可以调用二叉树的遍历算法，比较输出结点序列 1 编写采用二叉链表形式存储的二叉树...

2 编写将一棵二叉树的所有左右子树进行交换的算法。 提示：验证是否交换可以调用二叉树的遍历算法，比较输出结点序列 1 编写采用二叉链表形式存储的二叉树的创建、先序、中序、后序和按层遍历的算法。 创建的二叉树： -2 the preparation of a binary tree will be all about the exchange of sub-tree algorithms. Tip: Verify that the exchange can be called binary tree traversal algorithm to compare the output node sequence of a list prepared by using the binary form of a binary tree stored in the creation, the first sequence, in sequence, after the order and by level traversal algorithms. Create a binary tree: