Note:
递归就不往这里写了,记录个迭代的办法(用stack)
代码如下:
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
vector<int> inorderTraversal(TreeNode* root) {
stack<TreeNode*> stk;
vector<int> ans;
while(root || stk.size()){
while(root){
stk.push(root);
root = root -> left;
}
auto t = stk.top();
stk.pop();
ans.push_back(t -> val);
root = t -> right;
}
return ans;
}
};