leetcode c++ 树的非递归先序遍历/ 中序遍历/ 后序遍历/ 层序遍历

先序遍历

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    vector<int> preorderTraversal(TreeNode* root) {
        vector<int> res;
        if(root==NULL) return res;
        stack<TreeNode*> s;
        s.push(root);
        while(!s.empty()){
            TreeNode* p=s.top();
            s.pop();
            res.push_back(p->val);
            if(p->right!=NULL){
                s.push(p->right);
            }
            if(p->left!=NULL){
                s.push(p->left);
            }
        }
        return res;
    }
};

中序遍历

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    vector<int> inorderTraversal(TreeNode* root) {
        vector<int> res;
        stack<TreeNode*> path;
        while(root){
            path.push(root);
            root=root->left;
        }
        while(!path.empty()){
            TreeNode* p=path.top();
            path.pop();
            res.push_back(p->val);
            p=p->right;
            while(p){
                path.push(p);
                p=p->left;
            }
        }
        return res;
    }
};

后序遍历

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    vector<int> postorderTraversal(TreeNode* root) {
        vector<int> res;
        if(root==NULL) return res;
        stack<TreeNode *> s1,s2;
        s1.push(root);
        while(!s1.empty()){
            TreeNode* p=s1.top();
            s1.pop();
            s2.push(p);
            if(p->left!=NULL){
                s1.push(p->left);
            }
            if(p->right!=NULL){
                s1.push(p->right);
            }
        }
        while(!s2.empty()){
            TreeNode* p=s2.top();
            s2.pop();
            res.push_back(p->val);
        }
        return res;
    }
};

 层序遍历

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    vector<vector<int>> levelOrder(TreeNode* root) {
        queue<TreeNode*> q;
        vector<vector<int>> res;
        if(root==NULL) return res;
        q.push(root);
        while(!q.empty()){
            vector<int> v;
            int len=q.size();
            for(int i=0;i<len;i++){
                TreeNode* fro=q.front();
                q.pop();
                v.push_back(fro->val);
                if(fro->left!=NULL) q.push(fro->left);
                if(fro->right!=NULL) q.push(fro->right);
            }
            res.push_back(v);
        }
        return res;
    }
};