1、题目:点击打开链接
2、题目:
Given a binary tree, return the inorder traversal of its nodes' values.
For example:
Given binary tree [1,null,2,3]
,
1 \ 2 / 3
return [1,3,2]
.
3、代码:
/**
* 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> v(0);
stack<TreeNode*> s;
TreeNode*p=root;
while(!s.empty()||p!=NULL){
if(p!=NULL){
s.push(p);
p=p->left;
}
else{
p=s.top();
s.pop();
v.push_back(p->val);
p=p->right;
}
}
return v;
}
};