Morris 先序遍历

最新推荐文章于 2023-04-08 20:13:01 发布

GavinAlgorithm

最新推荐文章于 2023-04-08 20:13:01 发布

阅读量525

点赞数

文章标签：算法

本文链接：https://blog.csdn.net/shzhqmeng/article/details/47131965

版权

/*************************************************************************
  * File Name: Solution.cpp
  * Description: 
  * Author: Yuji CAO
  * Mail: caoyuji@sogou-inc.com
  * Created_Time: 2015-07-29 17时40分29秒
  * Last modified: 2015-07-29 17时40分29秒
 ************************************************************************/
#include<stdio.h>
#include<vector>
using namespace std;
struct TreeNode{
    int _val;
    TreeNode* _left;
    TreeNode* _right;
    TreeNode(int val):_val(val),_left(NULL),_right(NULL){}
};
void preTravel(TreeNode* root,vector<int>& ret){
    TreeNode* cur=root;
    while(cur){
        if(cur->_left==NULL){
            ret.push_back(cur->_val);
            cur=cur->_right;
        }else{
            TreeNode* node=cur->_left;
            while(node->_right!=NULL&&node->_right!=cur){
                node=node->_right;
            }
            if(node->_right==cur){//already trailed
                ret.push_back(cur->_val);
                node->_right=NULL;
                cur=cur->_right;
            }else{//not trailed
                node->_right=cur;
                cur=cur->_left;
            }
        }
    }
}
int main(){
    vector<int> ret;
    TreeNode *root=new TreeNode(1);

    root->_left=new TreeNode(2);
    root->_right=new TreeNode(3);

    root->_left->_left=new TreeNode(4);
    root->_left->_right=new TreeNode(5);
    root->_right->_left=new TreeNode(6);
    root->_right->_right=new TreeNode(7);

    root->_left->_left->_left=new TreeNode(8);
    root->_left->_right->_right=new TreeNode(10);

    root->_left->_left->_left->_right=new TreeNode(9);

    preTravel(root,ret);
    for(auto ele:ret){
        printf("%3d",ele);
    }
    putchar('\n');
    return 0;
}