LeetCode_144.二叉树先序遍历

Binary Tree Preorder Traversal

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

Example:

Input: [1,null,2,3]
   1
    \
     2
    /
   3

Output: [1,2,3]
Follow up: Recursive solution is trivial, could you do it iteratively?

---

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) {
        vector<int> res;
        if(root==nullptr)
            return res;
        CorepreorderTraversal(root,res); //传入一个vector容器保存结果
        
        return res;
    }
private:
    void CorepreorderTraversal(TreeNode *root,vector<int>& res)
    {
        if(root==nullptr)
            return;
        res.push_back(root->val);
        CorepreorderTraversal(root->left,res);
        CorepreorderTraversal(root->right,res);
    }
};

2.非递归解

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
struct Common{
    string s;
    TreeNode* node;
    Common(string s,TreeNode* node):s(s),node(node){}
};//命令栈结构
class Solution {
public:
    vector<int> preorderTraversal(TreeNode* root) {
        vector<int> res;
        if(root==nullptr)
            return res;
        stack<Common> stack;
        stack.push(Common("go",root));
        while(!stack.empty())
        {
            Common common=stack.top(); //出栈：打印操作
            stack.pop();
            if(common.s=="print")
                res.push_back(common.node->val);
            else
            {                          //先序遍历顺序：根结点-》左子树-》右子树
                assert(common.s=="go");//入栈顺序相反：右子树-》左子树-》根结点
                
                if(common.node->right)
                    stack.push(Common("go",common.node->right));
                if(common.node->left)
                    stack.push(Common("go",common.node->left));
                stack.push(Common("print",common.node));
            }
        }
        return res;
    }
};