【leetcode】二叉树先序遍历（stack）

144. Binary Tree Preorder Traversal

leetcode题目

题目描述

Pick One

Given a binary tree, return the preorder traversal of its nodes’ values.
For example:
Given binary tree [1,null,2,3],
1
\
2
/
3

return [1,2,3].
Note: Recursive solution is trivial, could you do it iteratively?

题解

根左右(root->left->right)。
用栈储存遍历得到结果序列。

Solution1:

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