Lintcode： 二叉树的中序遍历

问题：

给出一棵二叉树,返回其中序遍历

样例：

样例 1:

输入：{1,2,3}
输出：[2,1,3]
解释：
   1
  / \
 2   3
它将被序列化为{1,2,3}
中序遍历

样例 2:

输入：{1,#,2,3}
输出：[1,3,2]
解释：
1
 \
  2
 /
3
它将被序列化为{1,#,2,3}
中序遍历

python：

"""
Definition of TreeNode:
class TreeNode:
    def __init__(self, val):
        self.val = val
        self.left, self.right = None, None
"""

class Solution:
    """
    @param root: A Tree
    @return: Inorder in ArrayList which contains node values.
    """
    def inorderTraversal(self, root):
        # write your code here
        result = []
        node = [root]
        while root != None or len(node) != 1:
            while root != None:
                node.append(root)
                root = root.left
            root = node[-1]
            del node[-1]
            result.append(root.val)
            root = root.right
        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 {
public:
    /**
     * @param root: A Tree
     * @return: Inorder in ArrayList which contains node values.
     */
    vector<int> inorderTraversal(TreeNode * root) {
        // write your code here
        vector<int> result;
        
        TreeNode *temp = root;
        vector<TreeNode *> node;
        while(temp != NULL || node.size() != 0)
        {
            while(temp != NULL)
            {
                node.push_back(temp);
                temp = temp->left;
            }
            temp = node.back();
            node.pop_back();
            result.push_back(temp->val);
            temp = temp->right;
        }
        return result;
    }
};