[理工][資結] Tree的應用問題

看板Grad-ProbAsk作者ilikesg (SG )時間15年前 (2011/01/11 11:51)推噓-1(0推 1噓 0→)

留言1則, 1人參與討論串1/1

Consider inserting the keys 8,10,9,5,1,7,6,4,12,3 and 2 in order into each of the following data structures. Initially the tree is empty. Please draw the resulting tree. (a) Binary Search Tree (b) Max heap -- ※ 發信站: 批踢踢實業坊(ptt.cc) ◆ From: 115.43.41.89 ※ 編輯: ilikesg 來自: 115.43.41.89 (01/11 11:52)

噓

privatewind

01/11 17:40, , 1^F

01/11 17:40, 1^F

‣ 返回看板[ Grad-ProbAsk ] 研究

‣ 更多 ilikesg 的文章

文章代碼(AID): #1DAzF6fO (Grad-ProbAsk)