http://stackoverflow.com/questions/2329171/find-kth-smallest-element-in-a-binary-search-tree-in-optimum-way
On Sun, Jan 20, 2013 at 4:57 PM, Guneesh Paul Singh <gunees...@gmail.com>wrote: > not possible unless u use augmented bst..which itself takes o(n) to built > > -- > > > --
