using a rather complicated recursion.

look number of values on the left of the current node, if adding this node we get k - this is the node we are looking for.

Probably a heap is the right way to go