LeetCode - 144. Binary Tree Preorder Traversal

题目

LeetCode - 144. Binary Tree Preorder Traversal

题目链接

https://leetcode.com/problems/binary-tree-preorder-traversal/

参考博客

https://blog.csdn.net/gatieme/article/details/51163010

解题思路

此图采用两种解法，递归和迭代。递归做法简单，略过。

迭代：

从递归的角度分析知，先序遍历先一直向左子树遍历（Step1），当左子树为空时，再切换至右子树，并重新走Step1。

解题源码

1. 递归

/**
 * 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> ans;
    void dfs(TreeNode* d){
        if(!d) return;
        ans.push_back(d->val);
        dfs(d->left);
        dfs(d->right);
    }
    vector<int> preorderTraversal(TreeNode* root) {
        dfs(root);
        return ans;
    }
};

2. 迭代

/**
 * 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> ans;
        TreeNode* t = root;
        if (!t) return ans;
        stack<TreeNode*> st;
        while (t || !st.empty()) {
            while (t) {
                ans.push_back(t->val);
                st.push(t);
                t = t->left;
            }
            t = st.top();
            t = t->right;
            st.pop();
                        
        }
        return ans;
    }
};