数据结构实验。创建、保存、读取二叉树。且实现了二叉树的递归遍历，非递归遍历，递归求度为0、1、2节点数，非递归求度为0、1、2节点数,按层次遍历，求二叉树深度，判断是否完全二叉树，交换左右子树等功能……附带文件操作-Experimental data structure. Create, save, reading binary tree. And to achieve a binary tree of recursive traversal non-recursive traversal, recursive nodes 0,1,2 degree seeking, non-degree seeking 0,1,2 recursive nodes, according to the level through, seeking depth binary tree to determine are complete binary tree, exchange left and right subtrees with features such as file operations ... ...