题解 | #二叉树的前序遍历#
二叉树的前序遍历
https://www.nowcoder.com/practice/5e2135f4d2b14eb8a5b06fab4c938635
简单题
vector<int> res;
void dfs(TreeNode* node){
if(node==nullptr)return;
res.push_back(node->val);
dfs(node->left);
dfs(node->right);
}
vector<int> preorderTraversal(TreeNode* root) {
// write code here
dfs(root);
return res;
}
查看7道真题和解析