LintCode: Binary Tree Inorder Traversal

C++，递归，辅助函数

/**
 * Definition of TreeNode:
 * class TreeNode {
 * public:
 *     int val;
 *     TreeNode *left, *right;
 *     TreeNode(int val) {
 *         this->val = val;
 *         this->left = this->right = NULL;
 *     }
 * }
 */
class Solution {
    /**
     * @param root: The root of binary tree.
     * @return: Inorder in vector which contains node values.
     */
public:
    vector<int> inorderTraversal(TreeNode *root) {
        // write your code here
        vector<int> result;
        if (root == NULL) {
            return result;
        } else {
            inorderCore(root, result);
        }
        return result;
    }
    void inorderCore(TreeNode *root, vector<int> &result) {
        if (root->left != NULL) {
            inorderCore(root->left, result);
        }
        result.push_back(root->val);
        if (root->right != NULL) {
            inorderCore(root->right, result);
        }
    }
};

C++，递归

/**
 * Definition of TreeNode:
 * class TreeNode {
 * public:
 *     int val;
 *     TreeNode *left, *right;
 *     TreeNode(int val) {
 *         this->val = val;
 *         this->left = this->right = NULL;
 *     }
 * }
 */
class Solution {
    /**
     * @param root: The root of binary tree.
     * @return: Inorder in vector which contains node values.
     */
public:
    vector<int> inorderTraversal(TreeNode *root) {
        // write your code here
        vector<int> result;
        if (root == NULL) {
            return result;
        }
        if (root->left != NULL) {
            vector<int> left = inorderTraversal(root->left);
            result.reserve(result.size() + left.size());
            result.insert(result.end(), left.begin(), left.end());
        }
        result.push_back(root->val);
        if (root->right != NULL) {
            vector<int> right = inorderTraversal(root->right);
            result.reserve(result.size() + right.size());
            result.insert(result.end(), right.begin(), right.end());
        }
        return result;
    }
};

C++，非递归

/**
 * Definition of TreeNode:
 * class TreeNode {
 * public:
 *     int val;
 *     TreeNode *left, *right;
 *     TreeNode(int val) {
 *         this->val = val;
 *         this->left = this->right = NULL;
 *     }
 * }
 */
class Solution {
    /**
     * @param root: The root of binary tree.
     * @return: Inorder in vector which contains node values.
     */
public:
    vector<int> inorderTraversal(TreeNode *root) {
        // write your code here
        vector<int> result;
        if (root == NULL) {
            return result;
        }
        stack<TreeNode *> sta;
        TreeNode *cur = root;
        while (cur != NULL || !sta.empty()) {
            while(cur != NULL) {
                sta.push(cur);
                cur = cur->left;
            }
            cur = sta.top();
            sta.pop();
            result.insert(result.end(), cur->val);
            cur = cur->right;
        }
        return result;
    }
};