LeetCode:94. 二叉树的中序遍历(递归和迭代两种方法)
/**
* 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> res;
// vector<int> inorderTraversal(TreeNode* root) {//递归
// if(root==nullptr) return res;
// inorderTraversal(root->left);
// res.push_back(root->val);
// inorderTraversal(root->right);
// return res;
// }
vector<int> inorderTraversal(TreeNode* root) {//迭代
stack<TreeNode*>stk;
while(root||!stk.empty())
{
while(root)
{
stk.push(root);
root=root->left;
}
root=stk.top();
stk.pop();
res.push_back(root->val);
root=root->right;
}
return res;
}
};