二叉树的中序遍历
递归法
vector<int> res;
vector<int> inorderTraversal(TreeNode* root) {
if(!root) return res;
if(root->left) inorderTraversal(root->left);
res.push_back(root->val);
if(root->right) inorderTraversal(root->right);
return res;
}
迭代法
vector<int> res;
vector<int> inorderTraversal(TreeNode* root) {
stack<TreeNode*> stk;
vector<int> res;
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;
}