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?
confused what "{1,#,2,3}"
means? > read more on how binary tree is serialized on OJ.
Recursion Solution:
/**
* 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> inorderTraversal(TreeNode *root) {
vector<int> res;
inOrder(root,res);
return res;
}
void inOrder(TreeNode* root, vector<int>& res){
if (!root)
return;
inOrder(root->left, res);
res.push_back(root->val);
inOrder(root->right,res);
}
};
Iterative:
/**
* 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> inorderTraversal(TreeNode *root) {
vector<int> res;
stack<TreeNode*> stk;
while(root || !stk.empty()){
if (root){
stk.push(root);
root=root->left;
} else{
root=stk.top();
stk.pop();
res.push_back(root->val);
root=root->right;
}
}
return res;
}
};
再写一个算是pre-order的
/**
* 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> preorderTraversal(TreeNode *root) {
vector<int> res;
stack<TreeNode*> stk;
if (root)
stk.push(root);
while(stk.size()){
root=stk.top();
stk.pop();
res.push_back(root->val);
stk.push(root->right);
stk.push(root->left);
}
};
post order实在没想明白。。。碰到再说吧。。。。