Поиск элемента в двусвязном списке

#include <iostream>
#include <cstring>
#include <stdio.h>
#include <cstddef>
struct NodeLeter
{
    char word[60];
    int count;
    NodeLeter *next,*prev;//It's previor and next element
};
typedef NodeLeter*PNodeLeter;
PNodeLeter Head=NULL,Tail=NULL;//It's first and end head and tail
PNodeLeter CreateNodeLetter(char NewWord[])//We create node with function
{
PNodeLeter NewNodeLeter=new NodeLeter;
strcpy(NewNodeLeter->word,NewWord);
NewNodeLeter->count=1;
NewNodeLeter->next=NULL;//always must be null
NewNodeLeter->prev=NULL;//always NULL to
return NewNodeLeter;
}
void AddFirstElement(PNodeLeter&Head,PNodeLeter&Tail,PNodeLeter NewNodeLeter)//We add element for List
{
NewNodeLeter->next=Head;//It's always must be, head will be in NewNodeLeter
NewNodeLeter->prev=NULL;//from begining=NUll,its data from struct in begining
if(Head)Head->prev=NewNodeLeter;//Its bool operator,will do condition
Head=NewNodeLeter;//Head will save NewNodeLeter
if(!Tail)Tail=Head;//bool condition
}
void AddLastElement(PNodeLeter &Head,PNodeLeter &Tail,PNodeLeter NewNodeLeter)//With this function we add last element of list
{
NewNodeLeter->prev=Tail;
NewNodeLeter->next=NULL;
if(Tail)Tail->next=NewNodeLeter;
Tail=NewNodeLeter;
if(Head)Head=Tail;
}
 
void addAfter(PNodeLeter&Head,PNodeLeter&Tail,PNodeLeter p,PNodeLeter NewNodeLeter)//It's function Add element after
{
 if(!p->next)
  AddLastElement(Head,Tail,NewNodeLeter);
 else
{
   NewNodeLeter->next=p->next;
   NewNodeLeter->prev=p;
   p->next->prev=NewNodeLeter;
   p->next=NewNodeLeter;
}
}
 
void addBefore(PNodeLeter&Head,PNodeLeter&Tail,PNodeLeter p,PNodeLeter NewNodeLeter)//It's function Add element before
{
    if(!p->prev)
        AddFirstElement(Head,Tail,NewNodeLeter);
    else
 {
 NewNodeLeter->prev=p->prev;
 NewNodeLeter->next=p;
 p->prev->next=NewNodeLeter;
 p->prev=NewNodeLeter;
 }
}
 
PNodeLeter Find(PNodeLeter Tail,char NewWord[])//Find word
{
    PNodeLeter q=Tail;
    while (q&&strcmp(q->word,NewWord))
     q=q->prev;
    return q;
}
 
PNodeLeter FindPlace(PNodeLeter Tail,char NewWord[])
{
    PNodeLeter q=Tail;
    while (q&&(strcmp(q->word,NewWord)>0))
        q=q->prev;
    return q;
}
 
void Delete(PNodeLeter&Head,PNodeLeter&Tail,PNodeLeter OldNodeLeter)
{
    if (Head==OldNodeLeter)
{
  Head=OldNodeLeter->next;
    if (Head)
        Head->prev=NULL;
    else Tail=NULL;
}
delete OldNodeLeter;
}
 
int main()
{
    PNodeLeter p,where;
    FILE *in,*out;
    char word[60];
    int n;
    in=fopen("input1.txt","r");
    if(in!=NULL)printf("File open successfull!Press ENTER\n");//We entered from A...to last element
    getchar();
    while (1)
  {
    n=fscanf(in,"%s",word);
    if(n<0)break;
    p=Find(Tail,word);
    if(p)
    p->count++;
    else
{
 p=CreateNodeLetter(word);
 where=FindPlace(Tail,word);
 if(!where)AddFirstElement(Head,Tail,p);
 else addAfter(Head,Tail,where,p);//Wrote!!!
}
}
    fclose(in);
    printf("Double-linked list create successfull! Press ENTER\n");
    getchar();
    out = fopen("output-d.txt","w");
    p = Tail;
    while (p) {
        fprintf(out, "%-20s\t%d\n", p->word, p->count);
        p = p->prev;
    }
 
 fclose(out);
    return 0;
    }

string word

PNodeLeter Doit(PNodeLeter head, PNodeLeter tail, char ch)
{
    PNodeLeter cur = head;
    while (cur != tail)
    {
        if (cur.word[0] == ch)
        {
            //нашли. Теперь в cur хранится искомый адрес.
        }
        cur = cur->next;
 
    }
    //влево
    PNodeLetter leftCur = cur;
    while (leftCur != head)
    {
        //обработка
        leftCur = leftCur->prev;
    }
 
    //вправо
    PNodeLetter rightCur = cur;
    while (rightCur != head)
    {
        //обработка
        rightCur = rightCur ->next;
    }
 
    return cur;        
}