SDITSBST  Binary Search Tree
In this problem you are given two type of query
 Insert an integer to the list.
 Given an integer x, you're about to find an integer k which represent x's index if the list is sorted in descending order. Note that in this problem we will use 1based indexing.
As the problem title suggest, this problem intended to be solved using Binary Search Tree.
Input
The first line contains an integer Q, which denotes how many queries that follows.
The next Q lines will be one of the type queries which follow this format:
1 x means insert x to the list
2 x means find x's index if the list is sorted in descending order.
Output
For each query type 2, print a line containing an integer as the answer or print "Data tidak ada" no quotes if the requested number does not exist in the current lis.
Example
Input:1010 1 100 1 74 2 100 2 70 1 152 1 21 1 33 2 100 2 21 2 1 Output: 1 Data tidak ada 2 5 Data tidak ada
Explanation
Until the third query, the current list is {100, 74}. Therefore you must print 1 as 100 is on the first index.
Arriving at the fourth query we haven't add any other number so the list still consists of {100, 74}. Since 70 is not in the list you must print "Data tidak ada" remember no quotes.
For the last three queries the list looks like this {152, 100, 74, 33, 21}
So the answer for the eighth, ninth, and tenth query respectively are 2, 5, and "Data tidak ada".
Constraints
1 ≤ Q ≤ 200000
1 ≤ x ≤ 10^{18}
It is guaranteed that all integer that inserted in the list will be distinct.
Notes
Since the inteneded solution is using BST data structure. The testcases have been designed to be balanced i.e. you will never encounter such cases where the tree is skewed.
hide comments
phuff:
20191116 14:01:09
This will return a NZEC in Python 3. I had to rewrite in C++ 

Kholan:
20160604 12:19:45
@tieuchanlong NZEC means non zero exit code. Problems on SPOJ need to return 0 on exit. 

tieuchanlong:
20160603 16:56:02
Why I get a NZEC?? Last edit: 20160603 17:46:56 

stcsteven:
20160408 15:45:25
Is using InOrder recurrence can be counted as TLE? 

Arianto Wibowo:
20160408 02:22:25
There was a mistake in the testcases, however rejudge has been disabled by SPOJ. Please resubmit your solution to get the new verdict. Thanks and sorry for the inconvenience. Last edit: 20160408 06:05:48 
Added by:  Louis Arianto 
Date:  20160323 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 GOSU JSMONKEY 
Resource:  Praktikum Struktur Data D 2015  Institut Teknologi Sepuluh Nopember 