LeetCode 94: Binary Tree Inorder Traversal

和先序遍历类似，根节点的操作放在中间就可。

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

};