给你二叉树的根节点 root
,返回它节点值的 前序 遍历。
001 解法一 递归
/**
* 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 {
void preOrder(TreeNode *root, vector<int> &ans){
if (root) {
ans.push_back(root->val);
preOrder(root->left, ans);
preOrder(root->right, ans);
}
}
public:
vector<int> preorderTraversal(TreeNode* root) {
vector<int> ans;
preOrder(root, ans);
return ans;
}
};
002 栈调用
vector<int> preorderTraversal(TreeNode* root){
// 用来进行递归的栈
vector<int> ans;
// 用来存放遍历的结果,不算在空间复杂度里面
stack<TreeNode *> s;
// 开始利用栈来进行遍历
while (root || !s.empty()) {
// 模拟递归的压栈过程
while (root) {
s.push(root);
ans.push_back(root->val);
root = root->left;
}
// 当无法压栈的时候,将root.right进行压栈
root = s.top();
s.pop();
root = root->right;
}
return ans;
}
root = s.top();
s.pop();
root = root->right;
在取栈顶部元素后需要将顶部元素弹出,获取新的root的右孩子,如果右孩子为空,不能继续上面的循环操作,继续取栈顶部元素来判断指导存在右子树
003 Mirror
/**
* 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> preorderTraversal(TreeNode* root) {
vector<int> ans;
auto cur = root;
while (cur) {
if (cur->left) {
auto pre = cur->left;
while (pre->right && pre->right != cur) {
pre = pre->right;
}
if (!pre->right) {
ans.push_back(cur->val);
pre->right = cur;
cur = cur->left;
} else {
pre->right = nullptr;
cur = cur->right;
}
} else {
ans.push_back(cur->val);
cur = cur->right;
}
}
return ans;
}
};