以下C++代码实现二叉树广度优先搜索（BFS）查找目标节点，横线处应填入的代码是？

ax546492 单选题共个子题

TreeNode* findNode(TreeNode* root, int target) {
  if (root == nullptr) return nullptr;

  queue<TreeNode*> q;
  q.push(root);
  while (!q.empty()) {
    TreeNode* current = q.front();
    q.pop();

    if (current->val == target) {
      return current; // 找到目标节点
    }

    ________________________ // 在此处填入代码
  }
  return nullptr; // 未找到目标节点
}

if (current->left) q.push(current->left);
if (current->right) q.push(current->right);

if (current->left) q.pop(current->left);
if (current->right) q.pop(current->right);

if (current->left) q.front(current->left);
if (current->right) q.front(current->right);

if (current->left) q.push(current->right);
if (current->right) q.push(current->left);

正在加载题目数据…

第空

已答 /

子题

第空

提示

该题型需在试卷/作业中作答，单题练习暂不支持

答案解析

New