给定一棵普通二叉树(节点值没有大小规律),下面代码判断是否存在值为 x 的结点,则横线处应填入( )。class TreeNode: def __init__(self, x): self.val = x self.left = None self.right = None from collections import deque def bfs_find(root, x): if not root: return None q = deque() q.append(root) while q: cur = q.popleft() if cur.val == x: return cur ______________________ return None
A. q.append(cur.left)Copy
B. q.append(cur.right)Copy
C. if cur.left: q.append(cur.left) if cur.right: q.append(cur.right)Copy
D. if cur.right: q.append(cur.left) if cur.left: q.append(cur.right)Copy
正确答案:C
试卷来源:202512 CCF-GESP编程能力等级认证Python六级真题