[理工] [資料結構]99政大數位內容
第七題
題目如下
The largest element in a heap always appears in position 1,
and next largest element could be in position 2 or position 3
Please give the lists of the smallest(earliest)
and the largest(latest) possible positions in a heap
of size 15 for kth largest element,
for k=3,4,5 respectively
Assume that the values of all elements are distinct
我看完後還是不知道她要的答案是甚麼
是在問heap大小15中
第345大的數字的可能位置嗎
真的是看不太懂=
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 211.72.213.104
推
02/22 22:37, , 1F
02/22 22:37, 1F