N叉树的遍历

N叉树的遍历的迭代和递归实现

1、先序遍历

//迭代
class Solution {
public:
    vector<int> preorder(Node* root) {
        if(root == NULL) return vector<int>();

        vector<int> res;
        stack<Node*> mystack;
        mystack.push(root);

        while(!mystack.empty()){
            Node* node = mystack.top();
            mystack.pop();
            res.push_back(node->val);
            vector<Node*> child = node ->children;

            for(int i=child.size()-1;i>=0;i--){
                mystack.push(child.at(i));
            }

        }

        return res;
        
    }
};
//递归

class Solution {
public:
    vector<int> preorder(Node* root) {
        if(root == NULL) return vector<int>();

        vector<int> res;
        dfs(root,res);
        return res;
        
    }

    void dfs(Node* node,vector<int> &res){
        // if(node == NULL) return;
        vector<Node*> child = node->children;
        res.push_back(node->val);
        for(int i=0;i<child.size();i++){
            dfs(child.at(i),res);
        }

    }

};

2、后序遍历

//迭代
 class Solution {
 public:
     vector<int> postorder(Node* root) {
         if(root == NULL) return vector<int>();

         vector<int> res;
         stack<Node*> mystack;
         mystack.push(root);

         while(!mystack.empty()){
				Node* node = mystack.top();
				mystack.pop();
				vector<Node*> child = node->children;
				res.insert(res.begin(),node->val);

            for(int i=0;i<child.size();i++){
                mystack.push(child.at(i));
             }

         }

        return res;
        
     }
 };



//递归
class Solution {
public:
    vector<int> postorder(Node* root) {
        if(root == NULL) return vector<int>();

        vector<int> res;
        dfs(root,res);
        return res;
        
    }


    void dfs(Node* node,vector<int> &res){

        vector<Node*> child = node->children;
        

        for(int i=0;i<child.size();i++){
            dfs(child.at(i),res);
        }
        res.push_back(node->val);

    }


};

3、层序遍历

//迭代
class Solution {
public:
    vector<vector<int>> levelOrder(Node* root) {
        if(root == NULL) return vector<vector<int>>();

        vector<vector<int>> res;  
        queue<Node*> myqueue;

        myqueue.push(root);

        while(!myqueue.empty()){
            int size = myqueue.size();
            vector<int> levelNodes;
            for(int i=0;i<size;i++){
                Node* node = myqueue.front();
                vector<Node*> child = node ->children;
                myqueue.pop();
                levelNodes.push_back(node ->val);

                for(int i=0;i<child.size();i++){
                    myqueue.push(child.at(i));
                }
            }
            
            res.push_back(levelNodes);
    
        }


        return res;
        
    }
};
//递归
class Solution {
public:
    vector<vector<int>> levelOrder(Node* root) {
        if(root == NULL) return vector<vector<int>>();

        vector<vector<int>> res;  
        dfs(root,0,res);
        return res;
        
    }

    void dfs(Node* node,int currlevel,vector<vector<int>> &res){


        //递
        if(res.size() == currlevel){

            vector<int> levelNodes;
            levelNodes.push_back(node->val);
            res.push_back(levelNodes);
        }else{
            res.at(currlevel).push_back(node ->val);
        }

        for(Node* child: node ->children){
            dfs(child,currlevel+1,res);
        }

    }


};

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值