A binary search tree is a tree in which every node has at most two children nodes (a left and a right
child). Each node has an integer written inside it. If the number is written inside a node, then the
numbers in its left subtree are less than and the numbers in its right subtree are greater than .
You will be given a sequence of integers between and (inclusive) such that each number appears in
the sequence exactly once. You are to create a binary search tree from the sequence, putting the first
number in the root node and inserting every other number in order. In other words, run
for every other number:
insert( number X, node N ) increase the counter C by 1 if X is less than the number in node N if N has no left child create a new node with the number X and set it to be the left child of node N else insert(X, left child of node N) else (X is greater than the number in node N) if N has no right child create a new node with the number X and set it to be the right child of node N else insert(X, right child of node N)
Write a program that calculates the value of the counter after every number is inserted. The counter is initially .
The first line contains the integer , the length of the sequence. The remaining lines contain the numbers in the sequence, integers in the interval . The numbers will be distinct.
Output integers each on its own line, the values of the counter after each number is inserted into the tree.
In test cases worth of points, will be at most .
Sample Input 1
4 1 2 3 4
Sample Output 1
0 1 3 6
Sample Input 2
5 3 2 4 1 5
Sample Output 2
0 1 2 4 6
Sample Input 3
8 3 5 1 6 8 7 2 4
Sample Output 3
0 1 2 4 7 11 13 15