#include<bits/stdc++.h>
using namespace std;
typedef struct node
{
    int data,last;
    struct node *lchild,*rchild;

}*BitTree;
void InsertBitTree(BitTree &T,int x,int last)
{
    if(T == NULL)
    {
        T = new node;
        T->data = x;
        T->last = last;
        T->lchild = NULL;
        T->rchild = NULL;
        return;
    }
    if(x == T->data)
        return;
    else if(x < T->data)

        InsertBitTree(T->lchild,x,T->data);
    else
        InsertBitTree(T->rchild,x,T-&...