Description:
题目大意:二叉树前序遍历
解题思路:
算法标签:二叉树
代码:
/*
* struct TreeNode {
* int val;
* struct TreeNode *left;
* struct TreeNode *right;
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* };
*/
class Solution {
public:
vector<int> ans;
void previsited(TreeNode* root) {
if(root != NULL)
ans.push_back(root -> val);
if(root == NULL)
return;
previsited(root -> left);
previsited(root -> right);
}
vector<int> preorderTraversal(TreeNode* root) {
previsited(root);
return ans;
}
};