非递归写法:
/**
* 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 preOrder(TreeNode *root, vector<int>&res)
{
stack<TreeNode*> st;//引入一个栈
if (root == nullptr) return;//如果根节点为空,直接返回
st.push(root);//将根节点入栈
while (!st.empty())//当栈不为空时,循环
{
TreeNode *pTemp = st.top(); st.pop();//出栈
res.push_back(pTemp->val);//访问刚出栈的结点
//注意:入栈顺序是先右子节点,后左子节点
if (pTemp->right) st.push(pTemp->right);//如果有右子节点,入栈
if (pTemp->left) st.push(pTemp->left);//如果有左子节点,入栈
}
}
vector<int> preorderTraversal(TreeNode* root) {
vector<int> res;
preOrder(root, res);
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:
//先自己写一个前序遍历的递归函数
void preOrder(TreeNode *root, vector<int>&res)
{
//递归终止条件
if (root == nullptr) return;
//单层递归的处理
res.push_back(root->val);//中
preOrder(root->left, res);//左
preOrder(root->right, res);//右
}
vector<int> preorderTraversal(TreeNode* root) {
vector<int> res;
preOrder(root, res);
return res;
}
};