给定一个二叉树的根节点 root ,返回它的 中序 遍历。
1、递归
class Solution {
public:
vector<int> result;
void InOrder(TreeNode* root){
if(root){
InOrder(root->left);
result.push_back(root->val);
InOrder(root->right);
}
}
vector<int> inorderTraversal(TreeNode* root) {
InOrder(root);
return result;
}
};
2、用栈非递归实现
class Solution {
public:
vector<int> result;
vector<int> inorderTraversal(TreeNode* root) {
stack<TreeNode*> s;
while(root||!s.empty()){
if(root){
s.push(root);
root=root->left;
}
else{
root=s.top();
s.pop();
result.push_back(root->val);
root=root->right;
}
}
return result;
}
};