二叉树遍历所有代码.docVIP

#include?stdio.h#include?iostream#include?queue#include?stack#include?malloc.h#define?SIZE?100using?namespace?std;typedef?struct??BiTNode??????//定义二叉树节点结构{?char??data;?????????????????????//数据域?struct?BiTNode?*lchild,*rchild;?//左右孩子指针域}BiTNode,*BiTree;int?visit(BiTree?t); void?CreateBiTree(BiTree?T);????//生成一个二叉树void?PreOrder(BiTree);??????????//递归先序遍历二叉树void?InOrder(BiTree);???????????//递归中序遍历二叉树void?PostOrder(BiTree);?????????//递归后序遍历二叉树void?InOrderTraverse(BiTree?T);?//非递归中序遍历二叉树void?PreOrder_Nonrecursive(BiTree?T);//非递归先序遍历二叉树void?LeverTraverse(BiTree?T);//非递归层序遍历二叉树