leetcode 144. Binary Tree Preorder Traversal 二叉树前序遍历-递归、非递归

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

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> preorderTraversal(TreeNode* root) {
        pre(root);
        return result;
    }
    vector<int> result;
    void pre(TreeNode* root){
        if(root==nullptr)
            return;
        result.push_back(root->val);
        if(root->left != nullptr)
            pre(root->left);
        if(root->right!= nullptr)
            pre(root->right);
    }
};

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

非递归精简版：

/**
 * 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<TreeNode*> s;
        TreeNode* p = root;
        if(p!=nullptr)
            s.push(p);
        while(!s.empty())  {
            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;
    }
};