本文實(shí)例為大家分享了C語(yǔ)言非遞歸后序遍歷二叉樹的具體代碼，供大家參考，具體內(nèi)容如下
順義網(wǎng)站制作公司哪家好，找成都創(chuàng)新互聯(lián)公司！從網(wǎng)頁(yè)設(shè)計(jì)、網(wǎng)站建設(shè)、微信開發(fā)、APP開發(fā)、響應(yīng)式網(wǎng)站開發(fā)等網(wǎng)站項(xiàng)目制作，到程序開發(fā)，運(yùn)營(yíng)維護(hù)。成都創(chuàng)新互聯(lián)公司成立與2013年到現(xiàn)在10年的時(shí)間，我們擁有了豐富的建站經(jīng)驗(yàn)和運(yùn)維經(jīng)驗(yàn)，來(lái)保證我們的工作的順利進(jìn)行。專注于網(wǎng)站建設(shè)就選成都創(chuàng)新互聯(lián)公司。
法一：實(shí)現(xiàn)思路：一個(gè)棧 先按 根->右子樹->左子樹的順序訪問(wèn)二叉樹。訪問(wèn)時(shí)不輸出。另一個(gè)棧存入前一個(gè)棧只進(jìn)棧的結(jié)點(diǎn)。
最后輸出后一個(gè)棧的結(jié)點(diǎn)數(shù)據(jù)。
#include#include typedef struct TreeNode{ char element; struct TreeNode *left,*right; }Tree,*BTree; typedef struct StackNode{ BTree data; struct StackNode *next; }Stack,*PStack; typedef struct{ PStack top; }LinkStack,*PLinkStack; //初始化空棧 PLinkStack Init_Stack(void){ PLinkStack S; S=(PLinkStack)malloc(sizeof(LinkStack)); if(S){ S->top=NULL; } return S; } //壓棧 void Push_Stack(PLinkStack S,BTree T){ PStack p; p=(PStack)malloc(sizeof(Stack)); p->data=T; p->next=S->top; S->top=p; } //判空 int empty_Stack(PLinkStack S){ if(S->top){ return 0; }else{ return 1; } } //出棧 PStack Pop_Stack(PLinkStack S){ PStack q; if(empty_Stack(S)){ return S->top; }else{ q=S->top; S->top=S->top->next; } return q; } //銷毀棧 void DestroyStack(PLinkStack S){ PStack del; while(S->top!=NULL){ del=S->top; S->top=S->top->next; free(del); } free(S); } BTree BuildTree(void){ char ch; BTree node; ch=getchar(); if(ch=='#'){ node=NULL; }else{ node=(BTree)malloc(sizeof(Tree)); node->element=ch; node->left=BuildTree(); node->right=BuildTree(); } return node; } void NotRecursionPostOrder(BTree T){ PLinkStack S,CS; S=Init_Stack(); CS=Init_Stack(); while(T || !empty_Stack(S)){ if(T){ Push_Stack(S,T); Push_Stack(CS,T); T=T->right; }else{ T=Pop_Stack(S)->data; T=T->left; } } while(CS->top!=NULL){ printf("%c",CS->top->data->element); CS->top=CS->top->next; } DestroyStack(CS); } int main(void){ BTree T; T=BuildTree(); NotRecursionPostOrder(T); return 0; }
法二：實(shí)現(xiàn)思路。按先序遍歷訪問(wèn)每一個(gè)結(jié)點(diǎn)。存入棧中，當(dāng)為空時(shí)，就出立即棧（第一次出棧）。出棧后應(yīng)該立即進(jìn)棧，去訪問(wèn)進(jìn)棧結(jié)點(diǎn)的右結(jié)點(diǎn)，這樣可以保證先輸出左、右結(jié)點(diǎn)，再輸出根結(jié)點(diǎn)。二次進(jìn)棧利用flag標(biāo)記。
#include#include typedef struct TreeNode { char element; int flag; struct TreeNode *left, *right; }Tree, *BTree; typedef struct StackNode { BTree data; struct StackNode *next; }Stack, *PStack; typedef struct { PStack top; }LinkStack, *PLinkStack; //初始化空棧 PLinkStack Init_Stack(void) { PLinkStack S = (PLinkStack)malloc(sizeof(LinkStack)); if (S) { S->top = NULL; } return S; } //壓棧 void Push_Stack(PLinkStack S, BTree T) { PStack p; p = (PStack)malloc(sizeof(Stack)); p->data = T; p->next = S->top; S->top = p; } //判空 int empty_Stack(PLinkStack S) { if (S->top) { return 0; } else { return 1; } } //出棧 PStack Pop_Stack(PLinkStack S) { PStack q = S->top; S->top = S->top->next; return q; } BTree BuildTree(void) { BTree t; char ch; ch = getchar(); if (ch == '#') { t = NULL; } else { t = (BTree)malloc(sizeof(Tree)); t->element = ch; t->left = BuildTree(); t->right = BuildTree(); } return t; } void DestroyStack(PLinkStack S){ PStack p; while(S->top){ p=S->top; free(p); S->top=S->top->next; } } void NotRecursionPostOrder(BTree T) { PLinkStack S; S = Init_Stack(); while (T || !empty_Stack(S)) { if (T) { T->flag = 0; Push_Stack(S, T); T = T->left; } else { T = Pop_Stack(S)->data; if (T->flag == 0) { T->flag = 1; Push_Stack(S, T); T = T->right; } else { if (T->flag == 1) { printf("%c", T->element); T = NULL; } } } } DestroyStack(S);//銷毀棧 } int main(void) { BTree T; T = BuildTree(); NotRecursionPostOrder(T); return 0; }
以上就是本文的全部?jī)?nèi)容，希望對(duì)大家的學(xué)習(xí)有所幫助，也希望大家多多支持創(chuàng)新互聯(lián)。
重慶分公司
重慶分公司
