How many times of queryHeap() will be called when searching all keys not greater than qx=3?
对下图所示的最小堆进行qx=3的查找,需要调用多少遍queryHeap?
A6
B7
C5
D4
How many times of queryHeap() will be called when searching all keys not greater than qx=3?
对下图所示的最小堆进行qx=3的查找,需要调用多少遍queryHeap?
A6
B7
C5
D4
Copyright © 2020 www.daanwo.com All Rights Reserved |