题目
给定一个二叉树,返回它的中序 遍历。
示例:
输入: [1,null,2,3]
1
2
/
3
输出: [1,3,2]
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/binary-tree-inorder-traversal
解答
class Solution {
public:
vector<int> inorderTraversal(TreeNode* root) {
vector<int> res;
TreeNode* curr = root;
while(curr)
{
if(!curr->left)
{
res.push_back(curr->val);
curr = curr->right;
}
else
{
TreeNode* p = curr->left;
while(p->right)
p = p->right;//左子树中的最右侧结点
p->right = curr;//将curr设置为最右侧结点的右结点
TreeNode* tmp = curr;
curr = curr->left;//进入左子树
tmp->left = NULL;//将原curr的左子树置空
}
}
return res;
}
};
作者:princeteng-2
链接:https://leetcode-cn.com/problems/binary-tree-inorder-traversal/solution/mo-li-si-bian-li-cban-by-princeteng-2/
来源:力扣(LeetCode)
著作权归作者所有。商业转载请联系作者获得授权,非商业转载请注明出处。