AI题库 · GESP-Python六级题库
题目分享 #17733
以下代码实现了二叉树的广度优先搜索(BFS),并查找特定值的节点。横线上应填写( )。
from collections import deque
class TreeNode:
def __init__(self, val=0, left=None, right=None):
self.val = val
self.left = left
self.right = right
def find_node(root, target):
if root is None:
return None
q = deque()
q.append(root)
while q:
current = q.popleft()
if current.val == target:
return current
__________________
return None
A
if current.left:
q.append(current.right)
if current.right:
q.append(current.left)
B
if current.left:
q.append(current.left)
if current.right:
q.append(current.right)
C
if current.left:
q.append(current)
if current.right:
q.append(current.right)
D
if current.left:
q.append(current.left)
if current.right:
q.append(current)
AI题库 · 编程考级与信奥赛真题库
查看答案 →
复制链接后可在微信、QQ、小红书等平台粘贴分享;答案与解析在题目页。