[理工] 台大資工 資結
小弟有幾題問題想要問大家
98年資結 2.(4) Prove that the average height of the binary search tree
after inserting n integer values{1,2....n} in a random order
is O(logn).
這題毫無想法,只想到每次插入的可能性做高度平均,超複雜~~
--
※ 發信站: 批踢踢實業坊(ptt.cc), 來自: 61.228.71.129
※ 文章網址: https://www.ptt.cc/bbs/Grad-ProbAsk/M.1422966406.A.176.html
→
02/03 22:03, , 1F
02/03 22:03, 1F
→
02/03 22:04, , 2F
02/03 22:04, 2F
→
02/03 22:06, , 3F
02/03 22:06, 3F
→
02/03 22:19, , 4F
02/03 22:19, 4F
→
02/03 22:21, , 5F
02/03 22:21, 5F
→
02/03 22:21, , 6F
02/03 22:21, 6F
→
02/03 22:23, , 7F
02/03 22:23, 7F
→
02/03 22:24, , 8F
02/03 22:24, 8F
→
02/03 22:25, , 9F
02/03 22:25, 9F
→
02/03 22:25, , 10F
02/03 22:25, 10F