作者EntHeEnd (...)
看板Grad-ProbAsk
标题[理工] [资结]台大98
时间Sat Feb 6 16:43:15 2010
Prove that the average height of the BST after inserting n integer values
{1,2,...,n}in a random order is O(log n)
请问这题要怎样证呢 ?
--
※ 发信站: 批踢踢实业坊(ptt.cc)
◆ From: 59.126.125.176
1F：→ EntHeEnd:我翻一下书 好像是Thomas Cormen 放在有星号的章节的内容 02/06 17:28