Binary Tree

[naskopw]

Can someone please see whats the matter.
The search function is not working.

#include<iostream>
using namespace std;

const unsigned size = 6;

struct Tree
{
    int Key;
    string Data;
    Tree* left;
    Tree* right;
};

Tree* vert(int k)
{
    Tree* S = new Tree;
    S->Key = k;
    S->left = NULL;
    S->right = NULL;
    return S;
}
Tree* Search (int k,Tree* X)
{
    if(X == NULL)   return NULL;

    else if (X->Key<k) return Search(k,X->left);
    else if (X->Key>k)  return Search(k,X->right);
    else if (X->Key == k)   return X;
}
Tree* add(int k,Tree* X)
{
    if(X == NULL)
    {
        X = vert(k);
    }

    else if(k < X->Key) X->left = add(k,X->left);
    else if(k > X->Key) X->right = add(k,X->right);

    return X;
}

void printTree(Tree* X)
{
    if(X == NULL) return;
    cout<<X->Key<<" - HEAD!!"<<endl;
    cout<<"Now the left part\n";
    printTree(X->left);
    cout<<"Now right \n";
    printTree(X->right);
}
int main()
{
    Tree* T = NULL;
    Tree* res;
    bool result;
    int a,i=0;
    string w;
    for(i=0;i<size;i++)
    {
        cout<<"Cin vertex\n";
        cin>>a;
        T = add(a,T);
    }
    res = Search(5,T);
    cout<<res->Key<<endl;
     printTree(T);
}

[Reaper1]

Are you getting an error when your going to compile or is something not working? Post the problem/error.

[naskopw]

It works only if I'm searching for the root

[Reaper1]

Oh lol sorry you did post the problem you said the search function wasnt working, so sorry i missed that, i havent really done anything like that, but my guess would be because of the return statements in the search function, i mean i could be wrong and if i am im sure someone else ill help you.

If it does happen to be the return statments though, try putting them at the end of the search function.