合肥工业大学数据结构试验四线索二叉树，包括完整的实验要求、实验预习报告、实验最终报告



实验任务∶



<1>按先序次序遍历先序线索二叉树。



<2>按中序次序遍历中序线索二叉树。



<3>将值为x的结点作为先序线索二叉树T的左子树的（先序）最后一个结点的右孩子插入进去。



<4>按中序次序线索化二叉树。



<5>按后序次序线索化二叉树。-Four threaded binary tree data structure test of Hefei University, including the complete experimental requirements, the prelab report experiment final report experimental tasks: < 1>　threaded binary tree traversal preorder preorder order. < 2>　in sequence order traversal inorder threaded binary. < 3>　node as the value of x in the left subtree of the first order threaded binary tree T (pre-order) to the right child of the last node is inserted into it. < 4>　cued by order of inorder binary tree. < 5>　by subsequent order clues of binary tree.