leetcode——144. Binary Tree Preorder Traversal

最新推荐文章于 2024-10-16 13:10:37 发布

errly_liu2828

最新推荐文章于 2024-10-16 13:10:37 发布

阅读量134

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/errly_liu2828/article/details/120337056

版权

leetcode 专栏收录该内容

6 篇文章 0 订阅

订阅专栏

描述

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

Example 1:
在这里插入图片描述

Input: root = [1,null,2,3]
Output: [1,2,3]

Example 2:

Input: root = []
Output: []

Example 3:

Input: root = [1]
Output: [1]

递归

/**
 * 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:
    vector<int> preorderTraversal(TreeNode* root) {
        vector<int> ans;
        Pre(root, ans);
        return ans;
    }
    void Pre(TreeNode* root, vector<int>& ans){
        if(root != nullptr)
        {
            ans.push_back(root->val);
            Pre(root->left, ans);
            Pre(root->right, ans);
        }
    }
};

栈

class Solution {
public:
    vector<int> preorderTraversal(TreeNode* root) {
        vector<int> ans;
        stack<TreeNode *> stk;
        if(root != nullptr)
            stk.push(root);
        while(!stk.empty()){
            TreeNode* p = stk.top();
            stk.pop();
            ans.push_back(p->val);
            if(p->right != nullptr)
                stk.push(p->right);
            if(p->left != nullptr)
                stk.push(p->left);
        }
        return ans;
    } 
};