连三天都是easy烂题是怎样 = =
https://leetcode.com/problems/binary-tree-inorder-traversal/
这个我就跳过解释直接付code
class Solution {
public:
vector<int> inorderTraversal(TreeNode* root) {
vector<int> output;
stack<TreeNode*> temp;
TreeNode* cur = root;
while (!temp.empty() || cur) {
while (cur) {
temp.push(cur);
cur = cur->left;
}
cur = temp.top();
temp.pop();
output.push_back(cur->val);
cur = cur->right;
}
return output;
}
};