递归:
思路:按照前后中的顺序即可,递归实现起来比较简单。
/**
* 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) {
vector<int> v;
stack<TreeNode*> s;
TreeNode* curr=root;
if(!root)
return v;
while(curr||!s.empty()){
if(curr){
s.push(curr);
curr=curr->left;
}else{
curr=s.top();
s.pop();
v.push_back(curr->val);
curr=curr->right;
}
}
return v;
}
};
非递归:
思路:后序遍历是左右中,前序遍历是中左右,因此可以将前序遍历改成中右左,再利用reverse函数将其翻转成左右中,不过,如果不能用STL,C语言怎么处理呢。
/**
* 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> postorderTraversal(TreeNode* root) {
vector<int> v;
stack<TreeNode*> s;
if(!root)
return v;
s.push(root);
while(!s.empty()){
TreeNode* curr;
curr=s.top();
s.pop();
v.emplace_back(curr->val);
if(curr->left) s.push(curr->left);
if(curr->right) s.push(curr->right);
}
reverse(v.begin(),v.end());
return v;
}
};