给定一个二叉树的根节点 root ,返回它的 中序 遍历。
解答:
/**
* 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:
void helper(const TreeNode* root, vector<int>& res){
if(root == nullptr) return;
helper(root->left, res);
res.emplace_back(root->val);
helper(root->right, res);
}
vector<int> inorderTraversal(TreeNode* root) {
vector<int> res;
helper(root, res);
return res;
}
};
解答二:迭代
class Solution {
public:
vector<int> inorderTraversal(TreeNode* root) {
vector<int> res;
stack<TreeNode*> st;
while(!st.empty() || root != nullptr){
while(root != nullptr){
st.emplace(root);
root = root->left;
}
root = st.top();
st.pop();
res.emplace_back(root->val);
root = root->right;
}
return res;
}
};