Бинарное дерево поиска: "Библиотека", поиск по автору книги

#include <iostream>
#include <cstring>
#include <cstdlib>
#define SURNAME 30
#define BOOK_TITLE 50
 
using namespace std;
 
struct Lib{
    int cipher;
    char surname[SURNAME];
    char book_title[BOOK_TITLE];
};
 
struct Node{
    Lib data;
    Node* left;
    Node* right;
};
Lib* createNew();
Lib* libInput(Lib* lib);
Node* createNode(Node* root,Node* r,Lib* lib);
void printTree(Node* root);
void printFoundNode(Node* root);
Node* searchNode(Node* root,char sur[]);
 
 
int main()
{
    int count = 0;
    char surname[SURNAME] = {0};
    Node* root = NULL;
    cout<<"Enter count of book's : ";cin>>count;
    int i(1);
    do
    {
        cout<<"Enter data for "<<i<<" book : ";
        root = createNode(root,root,libInput(createNew()));
        i++;
    } while(i<=count);
    system("cls");
    printTree(root);
    cout<<"Enter author : ";cin.getline(surname,SURNAME);
    root = searchNode(root,surname);
    printFoundNode(root);
 
return 0;
}
 
 
Lib* createNew()
{
    Lib* item = new Lib;
    return item;
}
 
Lib* libInput(Lib* lib)
{
    cout<<endl<<"Enter book's cipher : ";cin>>lib->cipher;
    cout<<"Enter book's author's surname: ";cin.get();cin.getline(lib->surname,SURNAME);
    cout<<"Enter book's title: ";cin.getline(lib->book_title,BOOK_TITLE);
    return lib;
}
 
Node* createNode(Node* root,Node* r,Lib* lib)
{
    if(!r)
    {
    r = new Node;
    r->left = NULL;
    r->right = NULL;
    r->data.cipher = lib->cipher;
    strcpy(r->data.surname,lib->surname);
    strcpy(r->data.book_title,lib->book_title);
    if(!root) return r;
    if(lib->cipher < root->data.cipher)
        root->left = r;
    else root->right = r;
    return r;
    }
    else if(r->data.cipher > lib->cipher)
        createNode(r,r->left,lib);
    else createNode(r,r->right,lib);
    return root;
}
 
 
void printTree(Node* root)
{
    if(!root) return;
 
    printTree(root->left);
    cout<<"Book's cipher : "<<root->data.cipher<<endl;
    cout<<"Book's author's surname : "<<root->data.surname<<endl;
    cout<<"Book's title : "<<root->data.book_title<<endl<<endl<<endl;
    printTree(root->right);
}
 
void printFoundNode(Node* root)
{   if(!root)
    return;
 
    cout<<"Book's cipher : "<<root->data.cipher<<endl;
    cout<<"Book's title : "<<root->data.book_title<<endl<<endl<<endl;
}
 
Node* searchNode(Node* root,char sur[])
{
    int tmp = 0;
    if(!root)
    {
    return NULL;
    }
    if((tmp = strcmp(root->data.surname,sur))==0)
    {
        return root;
    }
    searchNode(root->left,sur);
    searchNode(root->right,sur);
}