小弟有幾題問題想要問大家 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). 這題毫無想法，只想到每次插入的可能性做高度平均,超複雜～～
覺得我的寫法可能拿不到分 看看就好given a set {1,2....n} nodeseach node may be a leaf in same posibilitythus we know that in BST average serch time isO(lgn), for those leafs serch times = tree heightthen the BST will be average height O(lgn)