单选题：When inserting a new key `a` into a binary search tree `T` with

When inserting a new key `a` into a binary search tree `T` with 1022 nodes, the worst-case number of comparisons between `a` and the keys already in `T` is in the range of: @[B](3)

A. [11, 1022]
B. [10, 1022]
C. [10, 1023]
D. [11, 1023]




A.[11, 1022]
B.[10, 1022]
C.[10, 1023]
D.[11, 1023]


答案：B