Given a binary tree, return the inorder traversal of its nodes' values.
Example:
Input: [1,null,2,3] 1 \ 2 / 3 Output: [1,3,2]
/**
* 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>result;
vector<int> inorderTraversal(TreeNode* root) {
intravel(root);
return result;
}
void intravel(TreeNode *index){
if(index==NULL)
return;
if(index->left!=NULL)
intravel(index->left);
result.push_back(index->val);
if(index->right!=NULL)
intravel(index->right);
}
};