二叉树以lson-rson链接方式存储，以菜单方式设计并完成功能任务：建立并存储树、输出前序遍历结果、输出中序遍历结果、输出后序遍历结果、交换左右子树、统计高度，其中对于中序、后序的遍历运算要求采用非递归方式。-Binary links to lson-rson stored to design the menu and complete functional tasks: Create and store the tree, the output results before preorder, preorder output results preorder Results output, switching left and right subtrees, statistics height, which For the sequence, after the traversal operation requires a non-recursive manner.