1. 题目来源
2. 题目说明
3. 题目解析
前序:根+左+右
打印根,遍历左链,由下向上返回,遍历左链上的右儿子。
友情链接:
[M二叉树] lc102. 二叉树的层序遍历(队列+bfs)
[M二叉树] lc145. 二叉树的后序遍历(栈+dfs)
[M二叉树] lc94. 二叉树的中序遍历(栈+dfs)
[M二叉树] lc144. 二叉树的前序遍历(栈+dfs)
迭代代码:
/**
* 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) {
if (!root) return {};
vector<int> res;
stack<TreeNode*> stk;
while (root || stk.size()) {
while (root) {
res.push_back(root->val);
stk.push(root);
root = root->left;
}
root = stk.top()->right;
stk.pop();
}
return res;
}
};
递归代码:
/**
* 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> res;
vector<int> preorderTraversal(TreeNode* root) {
dfs(root);
return res;
}
void dfs(TreeNode* root) {
if (!root) return ;
res.push_back(root->val);
dfs(root->left);
dfs(root->right);
}
};