[理工] [資結]-T or F
T of F
1. A complete binary tree is also an AVL tree
2. Radix sort can only be performed on sequential lists,
not on linked lists.
3.Searching for a key in a heap takes worst-case time O(n)
1.覺得是F，答案給T
2.有點不懂，可以解釋一下嗎?
3.heap 找key怎麼找?
--
┌這篇文章讓您覺得？─────────────────────────────┐
│ │
│ 一"一 \ / >\\\< ╯ ╰ ∩ ∩ ▁ ▁ ＞＿＜ ㄧ ㄧ+ │
│ 皿 ε □ ▽ ▇Δ ▇ ╰╯ ╯ │
│ 北七 亂喔 害羞 莎笅 爽啦 哭爸 ＸＤ 科科 │
└──────────────────────────────────────┘
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 122.116.14.2
→
01/18 00:09, , 1F
01/18 00:09, 1F
推
01/20 04:10, , 2F
01/20 04:10, 2F
討論串 (同標題文章)