/*
 * File:   main.cpp
 * Author: Steven Leimberg
 *
 * Created on March 13, 2012, 2:16 PM
 */

#include <iostream>
#include <cstdlib>

using namespace std;

struct node{
    string prezname;
    node* Right;
    node* Left;
};

void insert(string, node*);

node* search(string, node*);

int main(){
    node* prezTreeRoot;
    prezTreeRoot = new node;
    insert("AA",prezTreeRoot);
}

void insert(string name, node* leafRoot){
    node* leaf = search(name,leafRoot);
    if(leaf!=NULL){
        if(name< leaf->prezname){
            leaf->Left=new node;
            leaf->Left->prezname=name;
            leaf->Left->Left=NULL;
            leaf->Left->Right=NULL;
        }
        if(name>leaf->prezname){
            leaf->Right=new node;
            leaf->Right->prezname=name;
            leaf->Right->Left=NULL;
            leaf->Right->Right=NULL;
        }
    }else{
        leaf=new node;
        leaf->prezname=name;
        leaf->Left=NULL;
        leaf->Right=NULL;
    }
}

node* search(string name, node* leaf){
    while(leaf!=NULL){
        if(leaf->prezname<name){
            leaf=leaf->Left;
        }
        if(leaf->prezname>name){
            leaf=leaf->Right;
        }
        if(leaf->prezname==name){
            cout<<name<<" already exists in this tree!"<<endl;
            break;
        }
    }
    return leaf;
}