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

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

A. [10, 511]
B. [9, 511]
C. [9, 512]
D. [10, 512]




A.[10, 511]
B.[9, 511]
C.[9, 512]
D.[10, 512]


答案：D