非递归先序中序后序遍历二叉树

最新推荐文章于 2024-04-13 17:45:29 发布

O2H

最新推荐文章于 2024-04-13 17:45:29 发布

阅读量172

点赞数

本文链接：https://blog.csdn.net/weixin_40800935/article/details/90647371

版权

节点的结构体

struct TreeNode{
	int value;
	TreeNode *left;
	TreeNode *right;
};

先序遍历

void xian(TreeNode *root){
	stack<TreeNode*> s;
    TreeNode *now=root;
    while(now||!s.empty()){
        if(now){
            cout<<s.value<<endl;
            s.push(now);
            now=now->left;
        }
        else{
            now=s.top();
            now=now->right;
            s.pop();
            
        }
    }
}

中序遍历

void zhong(TreeNode *root){
	stack<TreeNode*> s;
    TreeNode *now=root;
    while(now||!s.empty()){
        if(now){
            
            s.push(now);
            now=now->left;
        }
        else{
        	
            now=s.top();
            cout<<s.value<<endl;
            now=now->right;
            s.pop();
            
        }
    }
}

后序遍历：

void hou(TreeNode *root){
	stack<TreeNode*> s;
	TreeNode *now=root;
    TreeNode *last=NULL;
    while(now){
        s.push(now);
        now=now->left;
    }
    while(!s.empty()){
        now=s.top();
        
        if(last==now->right||now->right==NULL){
            cout<<now->value<<endl;
            last=now;
            s.pop();
        }
        else{
            now=now->right;
            while(now){
                s.push(now);
                now=now->left;
            }
        }
    }
}