Can a binary search be used in an ordered list to reduce the time complexity to Θ(log2n)?能否在有序列表中用二分查找使得时间复杂度降为Θ(log2n)？
AYes能
BNo, because the amortized time complexity of list expansion is not Θ(1)不能，因为列表扩容的分摊复杂度不是Θ(1)
CNo, because the list cannot be efficiently accessed by rank不能，因为列表不能高效地循秩访问
DYes, because the time complexity of the list delete node is Θ(1)能，因为列表删除节点的时间复杂度为Θ(1)