LeetCode 144.Binary Tree Preorder Traversal (二叉树的前序遍历)

题目描述：

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

 示例:

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

输出: [1,2,3]

 

AC C++ Solution:

不用多解释，看代码。

 

堆栈迭代解法：

/**
 * 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;
        stack<TreeNode *> stack;
        TreeNode *pCurrent = root;
        
        while(!stack.empty() || pCurrent) {
            if(pCurrent) {
                res.push_back(pCurrent->val);
                stack.push(pCurrent);
                pCurrent = pCurrent->left;
            }
            else {
                TreeNode *pNode = stack.top();
                stack.pop();
                pCurrent = pNode->right;
            }
        }
        return 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> nodes;
        preorder(root, nodes);
        return nodes;
    }
private:
    void preorder(TreeNode* root, vector<int>& nodes) {
        if (!root) {
            return;
        }
        nodes.push_back(root -> val);
        preorder(root -> left, nodes);
        preorder(root -> right, nodes);
    }
};

 

递归解法很好推广到中序和后序遍历中，只需要改变push_back(val)的位置就行了。