In a 4-level B tree with 15 keywords, the maximum number of nodes containing keywords is ()
A: 5
B: 6
C: 10
D: 15
A: 5
B: 6
C: 10
D: 15
举一反三
- The number of keywords in a 3-level B tree with a height of 5 is at least () A: 15 B: 31 C: 62 D: 242
- In a 5-level B tree with a height of 2, the number of keywords contained is at least () A: 5 B: 7 C: 8 D: 14
- A B-tree of level m with n keywords should have () leaf nodes A: n+1 B: n-1 C: mn D: nm/2
- 12 In the following sort algorithms, the sorting algorithm that is suitable for a large number of records keywords, but with a small number of keywords to be sorted is（ ）. A: cardinality sort B: quick Sort C: merge sort D: heap sort
- 网页的META标签是指（） A: title、h1、keywords B: description、alt、keywords C: robots、keywords、description D: keywords、description、h2