LeetCode144：二叉树的先序遍历

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

问题描述

给定一个二叉树，返回它的 前序 遍历。

 示例:

输入: [1,null,2,3]  
   1
    \
     2
    /
   3

输出: [1,2,3]

进阶: 递归算法很简单，你可以通过迭代算法完成吗？

解题思路

递归

/**
 * 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> res;
        if(root == nullptr)
            return res;
        helper(root, res);
        return res;
    }
private:
    void helper(TreeNode* node, vector<int>& res)
    {
        if(node == nullptr)
            return;
        res.push_back(node->val);

        helper(node->left, res);
        helper(node->right, res);
    }
};

非递归实现

/**
 * 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> res;
        preorderTraversal_impl(root, res);
        return res;
    }
private:
    void preorderTraversal_impl(TreeNode* root, vector<int> &res)
    {
        if(root == nullptr)
            return;
        stack<TreeNode*> sk;
        TreeNode* pCur = const_cast<TreeNode*>(root);
        sk.push(pCur);

        while(!sk.empty())
        {
            pCur = sk.top();
            res.push_back(pCur->val);
            sk.pop();
            if(pCur->right != nullptr)
                sk.push(pCur->right);
            if(pCur->left != nullptr)
                sk.push(pCur->left);
        }       
    }
};