二叉树的中序遍历
给定一个二叉树,返回它的中序 遍历。
示例:
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/binary-tree-inorder-traversal/
递归:
整体思路:
利用递归和回溯,深度优先
(1)从根节点开始遍历整根树
(2)如果存在左分支结点,父节点向左移动
(3)无左分支节点,输出父节点
(4)如果存在右分支结点,父节点向右移动
(5)重复2
代码:
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
vector<int> inorderTraversal(TreeNode* root) {
vector<int>res;
Traversal(root,res);
return res;
}
void Traversal(TreeNode* root,vector<int>&res) {
if (root == nullptr)
return;
Traversal(root->left, res);
res.emplace_back(root->val);
Traversal(root->right, res);
}
};
复杂度分析
时间复杂度:O(n)
空间复杂度:O(n)
栈:
代码:
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
vector<int> inorderTraversal(TreeNode* root) {
vector<int> res;
stack<TreeNode*> stk;
while (root != nullptr || !stk.empty()) {
while (root != nullptr) {
stk.push(root);
root = root->left;
}
root = stk.top();
stk.pop();
res.push_back(root->val);
root = root->right;
}
return res;
}
};