下面程序是一个二叉排序树的，横线处应该填入的是（ ）。 class BinarySortTree: def __init__(self): self.root = None def insert(self, key, value): node = TreeNode(key, value) if self.root is None: self.root = node return current = self.root while True: if key key: current = current.left else: current = current.right return None def inorder_traversal(self, node): if node: self.inorder_traversal(node.left) print(node.key, node.value) self.inorder_traversal(node.right)
A： if current.left is None: current.right = node return
B： if current.right is None: current.right = node return
C： if current.right is None: current.left = node return
D： if current.left is None: current.left = node return
正确答案：D
试卷来源：202412 CCF-GESP编程能力等级认证Python六级真题