1. Make inorder traversal and output k-th element. 2. Store in each node additional variable - amount of nodes in the subtree rooted at node. Process the query in O(height)
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
