掌握二叉树的链式和顺序存储结构，利用队列对二叉树进行运算。

二、实验内容：

1) 编写函数creatbt，其功能是将一维数组方式存储的二 叉树转化为链式存储的二叉树，返回root指针。

2) 编写函数freebt，其功能是释放二叉树链表节点的存储 空间。函数原型为：void freebt (TNODE * root)

3) 编写函数实现前序、中序和后序遍历；

-Master chain and sequential storage structure of the binary tree using a queue to operate the binary tree. Experimental content: 1) write function creatbt, its function is one-dimensional array stored binary tree into a chain store binary tree to return to the root pointer. 2) write functions freebt, and its function is to release binary tree list node storage space. The function prototype: void freebt (TNODE* root) 3) write functions preorder, inorder and postorder traversal