day14前序遍历递归和迭代

最新推荐文章于 2024-07-18 13:20:33 发布

风华正茂，挥斥方遒

最新推荐文章于 2024-07-18 13:20:33 发布

阅读量85

点赞数

分类专栏： leetcode 文章标签：二叉树前序遍历递归迭代数据结构

本文链接：https://blog.csdn.net/studyingforever666/article/details/127840203

版权

leetcode 专栏收录该内容

40 篇文章 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) {}
* };
*/


class Solution {
public:
#if 0
    vector<int> preorderTraversal(TreeNode* root) {
        vector<int> result;
        preorder(root, result);
        return result;
    }
    void preorder(TreeNode* root, vector<int> &result) {
        if (root != nullptr) {
            result.push_back(root->val);
            preorder(root->left, result);
            preorder(root->right, result);
        }
    }
#endif


#if 0
    vector<int> preorderTraversal(TreeNode* root) {
        vector<int> result;
        if (root == nullptr) return result;
        stack<TreeNode*> node_stack;
        node_stack.push(root);
        TreeNode* node;
        while (!node_stack.empty()) {
            node = node_stack.top();
            node_stack.pop();
            result.push_back(node->val);
            if (node->right) node_stack.push(node->right);
            if (node->left) node_stack.push(node->left);
        }
        return result;
    }
#endif


    vector<int> preorderTraversal(TreeNode* root) {
        vector<int> result;
        if (root == nullptr) return result;
        stack<TreeNode*> node_stack;
        TreeNode *node = root;
        while (node != nullptr || !node_stack.empty()) {
            if (node != nullptr) {
                result.push_back(node->val);
                node_stack.push(node);
                node = node->left;
            } else {
                node = node_stack.top();
                node_stack.pop();
                node = node->right;
            }
        }
        return result;
    }
};