/**
* 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) {
TreeNode *p = root;
stack<TreeNode *> stk;
vector<int> v;
while(p || !stk.empty()){
if(p){
stk.push(p);
p = p->left;
}else{
p = stk.top();
stk.pop();
v.push_back(p->val);
p = p->right;
}
}
return v;
}
};
Binary Tree Inorder Traversal
最新推荐文章于 2022-03-31 17:31:26 发布