binary-tree-preorder-traversal leetcode C++

最新推荐文章于 2022-05-08 09:10:52 发布

DarrenXf

最新推荐文章于 2022-05-08 09:10:52 发布

阅读量174

点赞数

分类专栏： Algorithm 牛客网算法 C++ leetcode 文章标签： leetcode C 算法牛客网

本文链接：https://blog.csdn.net/DarrenXf/article/details/82768108

版权

算法同时被 3 个专栏收录

149 篇文章 0 订阅

订阅专栏

Algorithm

147 篇文章 0 订阅

订阅专栏

牛客网

146 篇文章 0 订阅

订阅专栏

Given a binary tree, return the preorder traversal of its nodes' values.

For example: Given binary tree{1,#,2,3},

1
2 / 3

return[1,2,3].

Note: Recursive solution is trivial, could you do it iteratively?

C++

/**
 * Definition for binary tree
 * 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) {
        if (!root) return {};
        vector<int> res;
        stack<TreeNode*> s{{root}};
        while(!s.empty()){
            TreeNode *t = s.top(); s.pop();
            if (t->right) s.push(t->right);
            if (t->left) s.push(t->left);
            res.insert(res.end(),t->val);
            //res.insert(t->val);
        }
        return res;
    }
};