题目:
Given a binary tree, return the inorder traversal of its nodes' values.
For example:
Given binary tree {1,#,2,3}
,
1
\
2
/
3
return [1,3,2]
.
Note: Recursive solution is trivial, could you do it iteratively?
题解:
class Solution {
public:
vector<int> inorderTraversal(TreeNode *root) {
vector<int> result;
if(!root)
return result;
inorderRecursion(root, result);
return result;
}
void inorderRecursion(TreeNode *root, vector<int> & result)
{
if(!root)
return;
inorderRecursion(root->left, result);
result.push_back(root->val);
inorderRecursion(root->right, result);
}
};