Binary Search Tree 3

#include <iostream>
#include <string>
using namespace std;
struct gammal{
-string name;
-int score;
-gammal *left,*right;
-gammal(string n, int s){
--name = n;
--score = s;
--left = NULL;
--right = NULL;
-}
-void print(){
--cout<<name<<"\t"<<score<<endl;
-}
};
gammal* add(gammal *g, string n, int s){
-if( g == NULL){
--g = new gammal(n,s);
--return g;
-}
-if(s < g->score)
--g->left = add(g->left, n, s);
-if(s > g->score)
--g->right = add(g->right, n, s);
-return g;
}
void show (gammal *g){
-if(g==NULL)
--return;
-show(g->right);
-g->print();
-show(g->left);
}
int main(){
-gammal *g=NULL;
-int answer;
-do{
--cout<<"1) Add"<<endl;
--cout<<"2) Show"<<endl;
--cout<<"3) Exit"<<endl;
--cout<<"What would you like to do? ";
--cin>>answer;
--if(answer==1){
---string n;
---int s;
---cout<<"Name: ";
---cin>>n;
---cout<<"Score: ";
---cin>>s;
---g = add(g,n,s);
--}
--else if(answer==2)
---show(g);
-}while(answer == 1 || answer==2);
}