二叉树的遍历 --- 递归与非递归

最新推荐文章于 2021-02-01 16:30:44 发布

alpha_2017

最新推荐文章于 2021-02-01 16:30:44 发布

阅读量203

点赞数

分类专栏：数据结构与算法

本文链接：https://blog.csdn.net/alpha_love/article/details/106065668

版权

数据结构与算法专栏收录该内容

37 篇文章 0 订阅

订阅专栏

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
// 二叉树前序遍历
//144. Binary Tree Preorder Traversal                            // 前序遍历
class Solution {
public:
    vector<int> prevTraversal(TreeNode* root) {      
        if(!root)  return {};
        stack<TreeNode *> sk;
        sk.push(root);
        while(!sk.empty()){
            TreeNode * temp = sk.top();   
            sk.pop();
            result.push_back(temp->val);      
            if(temp->right!= NULL)
                sk.push(temp->right);
            if(temp->left != NULL)
                sk.push(temp->left);
        }
        return result;
    }
//94. Binary Tree Inorder Traversal           //二叉树中序遍历
// 中序遍历
    vector<int> inorderTraversal(TreeNode* root) {     
        if(!root)  return {};            
        stack <TreeNode*> stack;
        while (!stack.empty() || root != NULL) {
            if (root != NULL) {
                stack.push(root);
                root = root->left;
            } else {
                root = stack.top();
                stack.pop();
                result.push_back(root->val);
                root = root->right;
            }
        }
        return result;
    }
//145. Binary Tree Postorder Traversal                           // 后序遍历
    // 后续遍历
    void postorderTraversal(TreeNode*root) {
        if (root == NULL) 
            return;
        stack<TreeNode*> s1 ;
        stack<TreeNode*> s2 ;
        s1.push(root);
        while (!s1.empty()) {
            root = s1.top();
            s1.pop();
            s2.push(root);
            if (root->left != NULL) {
                s1.push(root->left);
            }
            if (root->right != NULL) {
                s1.push(root->right);
            }
        }

        while (!s2.empty()) {
            TreeNode *temp  = s2.top();
            s2.pop();
            result.push_back(temp->val);
        }
        return result;
    }


    vector<int> result;
};