标签：
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.
Subscribe to see which companies asked this question
c++ code:
/**
* 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> inorderTraversal(TreeNode* root) {
vector<int> ivec;
TreeNode *p=root;
stack<TreeNode *> s;
while(p || !s.empty()){
while(p){
s.push(p);
p=p->left;
}
if(!s.empty()){
p=s.top();
ivec.push_back(p->val);
s.pop();
p=p->right;
}
}
return ivec;
}
};LeetCode:Binary Tree Inorder Traversal
标签：
原文地址：http://blog.csdn.net/itismelzp/article/details/51524358
