...

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

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

void search (int k, node *leaf)
{
  if(leaf!=NULL)
  {
    if(k==leaf->T)
      return leaf;
    if(k<leaf->T)
      return search(k, leaf->left);
    else
      return search(k, leaf->right);
  }
  else return NULL;
}

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;
    }
    }

int main(){
    node*root=NULL;
    int k;

    insert(root,99);

    return 0;

}