单选题：It is known that a 3-heap is a heap whose nodes have 3 children.

It is known that a 3-heap is a heap whose nodes have 3 children. Suppose that the level-order traversal sequence of a max-3-heap is {88, 76, 65, 82, 68, 46, 52, 44, 62, 33, 75, 28, 55, 60}. Use the linear algorithm to adjust this max-3-heap into a min-3-heap, and then run DeleteMin. As a result, there are __ nodes whose positions are not moved in the process. @[B](3)

A. 2
B. 3
C. 4
D. 5




A.2
B.3
C.4
D.5


答案：B