二叉樹 遍歷非遞歸算法

1.二叉樹創建，節點爲空#代替，前序創建；例如：ab#cd##e##f##

#include <iostream> #include <stack> using namespace std; typedef struct TreeNode { char data; bool tag; struct TreeNode *left; struct TreeNode *right; }TreeNode,*PTreeNode; TreeNode* CreatBitTree(); void Post(PTreeNode root);//後序遍歷 void main() { PTreeNode root = CreatBitTree(); //PreTree(root); Post(root); } /* 遞歸前序建立二叉樹 */ TreeNode* CreatBitTree() { char ch; TreeNode *b; scanf("%c", &ch); /* 遇到空節點停止遞歸 */ if (ch == '#') { b = NULL; } else { b = (TreeNode*) malloc(sizeof(TreeNode)); /* 建立根節點 */ b->data = ch; /* 遞歸先序建立左子樹 */ b->left = CreatBitTree(); /* 遞歸先序建立右子樹 */ b->right = CreatBitTree(); } return b; }

 

2.後序非遞歸算法

//非遞歸後序算法 void Post(PTreeNode root) { stack<PTreeNode> s; TreeNode *p = root; while(true) { while (p)//p不爲空,所有左子樹入棧 { s.push(p); p->tag=false; p=p->left; } p = s.top(); s.pop(); while(p->tag==true)//右子樹返回 { cout<<p->data<<" ";//打印當前節點 if (s.empty()) { return; } p = s.top(); s.pop(); } //左子樹返回 p->tag = true;//true:right; false:left s.push(p); p = p->right; } }

3.中序遍歷

void MidOrder(TreeNode *root) { PTreeNode p = root; stack<PTreeNode> s; while(p||!s.empty()) { while(p)//左子樹入棧 { s.push(p); p=p->left; } p=s.top(); s.pop(); cout<<p->data<<" "; p=p->right; } }

4.前序遍歷

void PreOrder(PTreeNode root) { PTreeNode p = root; stack<PTreeNode> s; while(p||!s.empty()) { while (p) { cout<<p->data<<" "; s.push(p); p=p->left; } p=s.top(); s.pop(); p=p->right; } }