[理工] [資結]-95臺大(A)

[hoverg ()]

5. Draw step-by-step results in constructing
   the max heap tree after inserting 6,3,4,5,2,1,7,8
   and then deleting 2,7 sequentially.


   想請問的是，洪兔的資結筆記裡只有教怎麼delete min或max，
   像這種隨機刪除的要怎麼做啊？？？

--

家家是家，到家才是家~道道是道，放下見大道

--
※ 發信站: 批踢踢實業坊(ptt.cc) 
◆ From: 140.120.54.222
→ taitin:做法應該雷同