第21028题
C++实现二叉树深度优先搜索(DFS)的代码空缺处应填入的正确选项是?
struct TreeNode {    int val;    TreeNode* left;    TreeNode* right;    TreeNode(int x): val(x), left(nullptr), right(nullptr) {}};
void dfs(TreeNode* root, vector<int>& result) {    if (root == nullptr) return;    _________}
A
result.push_back(root->val);
dfs(root->left);
dfs(root->right);
B
result.push_back(root->left->val);
dfs(root->right);
dfs(root->left);
C
result.push_back(root->left->val);
dfs(root->left);
dfs(root->right);
D
result.push_back(root->right->val);
dfs(root->right);
dfs(root->left);
提交0次 正确率0.00%
答案解析