Find the k-th smallest value in a BST

Given an empty binary search tree with no nodes, you are asked to perform 2 kinds of queries:
  1. insert x - insert the value x in the BST
  1. smallest k - print the kth smallest element in the BST
Given q queries, you are asked to write a program to perform these queries.


The first line of the input contains a single number q (1 ≀ q ≀ 1000).
The next q lines contain queries. For all the insert queries, the value of x does not exceed in absolute value. For all the smallest queries, the value of k does not exceed the current tree size.


For each smallest query, the program should print the smallest kth element in the binary search tree.


8 insert 2 insert 1 smallest 1 smallest 2 insert 10 insert 20 smallest 3 smallest 2
1 2 10 2


Time limit: 2.4 seconds

Memory limit: 512 MB

Output limit: 1 MB

To check your solution you need to sign in