#include<iostream>
#include<cmath>
using namespace std;

struct node
{
  int T;
  node *LEFT;
  node *RIGHT;
};

void insert( node *&root, int k ){
    if (root!= NULL){
        insert (root, k);
    }
    else{
        root = new node;
        root -> T = k;
        root->LEFT = NULL;
        root->RIGHT = NULL;
    }
    }