建立一棵二叉树，用先序非递归方法遍历二叉树,1. 熟练掌握二叉树在二叉链表存储结构中的常用遍历方法：先序递归遍历、中序递归和非递归遍历、后序递归遍历。了解二叉树的按层遍历、先序非递归遍历及后序递归遍历。

求解系统幅频特性,求解相频特性，求解根轨迹，具有直观的用户界面，功能强大，操作简单。主程序为lab03.m和lab031.m-Solve the system amplitude frequency characteristics, solution phase frequency characteristics, solving root locus, with intuitive user interface, powerful, simple operation. The main pro

此为线性表的链式存储结构下的功能实现，例如新建、销毁、重置、插入及删除等。-This is the linear form of the chain store structure functions, such as new construction, destruction, reset, insert, and delete.