inorder Traversal

gistfile1.txt

https://oj.leetcode.com/problems/binary-tree-inorder-traversal/

/**
* Definition for binary tree
* struct TreeNode {
*     int val;
*     TreeNode *left;
*     TreeNode *right;
*     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
    vector<int> result;
    
    vector<int> inorderTraversal(TreeNode *root) {
        if( root != NULL ) {
            inorderTraversal(root->left);
            result.push_back(root->val);
            inorderTraversal(root->right);
            
            return result;
        } else {
            return result;
        }
    }
};