二叉树先序、中序、后序三种遍历的非递归算法,此三个算法可视为概要.docxVIP

#define maxsize 100 typedef struct { Bitree Elem[maxsize]; int top; }SqStack; void PreOrderUnrec(Bitree t { SqStack s; StackInit(s; p=t; while (p!=null || !StackEmpty(s { while (p!=null // éàú×ó×óê÷± { visite(p-data; push(s,p; p=p-lchild; }//endwhile if (!StackEmpty(s // í¨ 1???ò ?′ ??-? · ??μ ??ú ??while êμ ??óò×óê÷±éàú { p=pop(s; p=p-rchild; }//endif }//endwhile }//PreOrderUnrec 2.??? ò±éàú· ?μ ?1é ??·¨ #define maxsize 100 typedef struct { Bitree Elem[maxsize]; int top; }SqStack; void InOrderUnrec(Bitree t { SqStack s; StackInit(s; p=t; while (p!=null || !StackEmpty(s { while (p!=null // éà