4. Starting with an empty max-heap, perform the following 8 operations in order: (Insert 8), (Insert 4), (Insert 9), (Insert 6), (Extract-Max), (Insert 13), (Insert 17), (Extract-Max). Please draw the resulting max-heap tree after all operations are completed. \( (10\%) \)
詳解 (共 1 筆)
MoAI - 您的AI助手
詳解 #7643922
題旨分析 本題考查最大堆積樹的兩種基本操...
(共 1113 字,隱藏中)
前往觀看