Leetcode94. 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]. 

非常简单的中序遍历，都AC以后才弄明白说可不可以用迭代方法解决，不过在vs中研究了三种遍历方式，递归，栈，和morris。

用了好久弄明白了morris递归。

http://www.cnblogs.com/AnnieKim/archive/2013/06/15/morristraversal.html

这个博主说的特别明白，讲的也好~

/**
 * 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> inorderTraversal(TreeNode* root) {
        vector<int> res;
        inorder(root,res);
        return res;
    }
    void inorder(TreeNode* root,vector<int> &res)
    {
        if(root==NULL)
            return ;
        if(root->left!=NULL)
            inorder(root->left,res);
        res.push_back(root->val);
        if(root->right!=NULL)
            inorder(root->right,res);
    }
};