94. Binary Tree Inorder Traversal\144. Binary Tree Preorder Traversal\145. Binary Tree Postorder

94. Binary Tree Inorder Traversal

题目描述

Given a binary tree, return the inorder traversal of its nodes’ values.

For example:
Given binary tree [1,null,2,3],

   1
    \
     2
    /
   3

return [1,3,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:
    void inorderTraversalNode(TreeNode *root, vector<int> &res) {
        if(!root) return;

        inorderTraversalNode(root->left, res);
        res.push_back(root->val);
        inorderTraversalNode(root->right, res);
    }

    vector<int> inorderTraversal(TreeNode* root) {
        vector<int> res;
        inorderTraversalNode(root, res);
        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:
    void inorderTraversalNode(TreeNode *root, vector<int> &res) {
        if(!root) return;

        if(root->left) inorderTraversalNode(root->left, res);
        res.push_back(root->val);
        if(root->right) inorderTraversalNode(root->right, res);
    }

    vector<int> inorderTraversal(TreeNode* root) {
        vector<int> res;
        inorderTraversalNode(root, res);
        return res;
    }
};

144. Binary Tree Preorder Traversal

题目描述

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

For example:
Given binary tree {1,#,2,3},

   1
    \
     2
    /
   3

return [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:
    void preO(TreeNode* root, vector<int> &res) {
        if(!root) return;
        res.push_back(root->val);
        preO(root->left, res);
        preO(root->right, res);
    }
    vector<int> preorderTraversal(TreeNode* root) {
        vector<int> res;
        preO(root, res);
        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> res;
        stack<TreeNode*> stk;
        TreeNode* tp;
        if(root)  stk.push(root);
        while(!stk.empty()) {
            tp = stk.top();
            stk.pop();
            res.push_back(tp->val);
            if(tp->right) stk.push(tp->right);
            if(tp->left) stk.push(tp->left);
        }
        return res;
    }
};

145. Binary Tree Postorder Traversal

题目描述

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

For example:
Given binary tree {1,#,2,3},
   1
    \
     2
    /
   3
return [3,2,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:
    void postOrder(vector<int> &res, TreeNode* root) {
        if(!root) return;    
        if(root->left) postOrder(res, root->left);
        if(root->right) postOrder(res, root->right);
        res.push_back(root->val);
    }

    vector<int> postorderTraversal(TreeNode* root) {
        vector<int> res;
        postOrder(res, root);
        return res;
    }
};