[理工] [資結]台大98

[EntHeEnd (...)]

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
→ EntHeEnd:我翻一下書 好像是Thomas Cormen 放在有星號的章節的內容