一、题目
二、代码
/**
* 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:
//第一:参数和返回值
//第二:终止条件
//第三:每一层的逻辑
void tree_for_each_recursive(TreeNode* cur,vector<int>& result) //二叉树的递归遍历 其实是用的是栈
{
if(cur==nullptr) return;
//中序和后序遍历只需要微调顺序即可
result.push_back(cur->val);
tree_for_each_recursive(cur->left,result);
tree_for_each_recursive(cur->right,result);
};
vector<int> preorderTraversal(TreeNode* root)
{
vector<int> return_vector;
///递归
//tree_for_each_iteration(root,return_vector);
//迭代
stack<TreeNode*> my_stack_for_iteration;
if(root==nullptr) return return_vector;
else my_stack_for_iteration.push(root); //先将根节点压入堆栈
//思路:弹出处理节点 压入新节点 直到栈中无节点为止
while(!my_stack_for_iteration.empty())
{
TreeNode* node=my_stack_for_iteration.top(); //有必要记录一下这个节点 不然弹出之后就找不到左右节点了
return_vector.push_back(node->val); //取出栈顶的元素 核心:下一次pop出来的是要处理的节点
my_stack_for_iteration.pop();
if(node->right) my_stack_for_iteration.push(node->right);
if(node->left) my_stack_for_iteration.push(node->left);
}
return return_vector;
}
};