单选题：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 1025 nodes, the worst-case number of comparisons between `a` and the keys already in `T` is in the range of: @[D](3)

A. [11, 1024]
B. [10, 1024]
C. [10, 1025]
D. [11, 1025]




A.[11, 1024]
B.[10, 1024]
C.[10, 1025]
D.[11, 1025]


答案：D