次程序为数据结构中的二叉树，用汇编语言实现，包括了大部分8086汇编指令。

1.构建二叉树 2.编写递归算法，交换二叉树的左右子树； 3.输出按先序遍历得到的新二叉树结果。 -1 build a binary tree 2 write a recursive algorithm, exchange the left and right binary subtree 3 preorder traversal of the output obtained by a new binary tree results.

建立一棵含有n个结点的二叉树，采用二叉链表存储, 前序（或中序、后序）遍历该二叉树。 -Create a binary tree with n nodes, using a binary linked list storage, pre-order (or sequence order) traversal of the binary tree.

编写递归算法，在二叉树中求位于先序序列中第k个位置的结点的值- Write a recursive algorithm, and seeking in the first sequence binary sequence of k-th position of the value of a node