Check Palindrome using double link list

Palindrome  is A palindrome is a word, phrase, number, or other sequence of symbols or elements, whose meaning may be interpreted the same way in either forward or reverse direction.(wiki answer).
Two check given string is palindrome or not.It is very easy if we use double link list.

Procedure :-

::-  insert each char of string in double link list with each node contain only one char.

::- intialise "HEAD" to first node & "TELL" to last node.

::- check data at first node & last node then increment head & decrement in tell than check     again untill any mismatch found or they reaches to mid of list

;;- IF all are match than it is successful condition else unsuccessful

                                  C program :-

 //palindrome;  
 //if you found spelling mistake anywhere please ignore  
 #include<stdio.h>  
 #include<stdlib.h>  
 #include<malloc.h>  
 #include<string.h>  
 int create(char);  
 int check(int);  
 struct node  
 {  
      char c;  
      struct node *fro;  
      struct node *back;  
 }*head=NULL,*tell=NULL; // to pointer head point to first node & tell point to last node   
             //initialy list is empty so head=tell=NULL  
 typedef struct node node;  
 main()  
 {  
      char arr[20];  
      int m,i;  
      printf("\n enter string to check :");  
      scanf("%s",&arr);  
      m=strlen(arr);    // calculating lenghth of string  
      printf("\n length of string is %d",m);  
      for(i=0;i<m;i++)  
      {  
           create(arr[i]); // creating a double ling list with each node containning a single char  
      }  
      display();  
      check(m);   
 }   
 create(char ch) // creating double link list  
 {  
      node *temp,*r;  
      temp=head;  
      r=(node*)malloc(sizeof(node));  // allocating space node dynamicaly  
      r->c=ch;  
      if(head == NULL)  
      {  
           head=r;  
           tell=r;  
           head->fro=NULL;  
           head->back=NULL;  
      }  
      else  
      {  
           tell->fro=r;  
           r->back=tell;  
           tell=tell->fro;  
           tell->fro=NULL;  
      }  
 }  
 display()  
 {  
      node *temp;  
      temp=head;  
      printf("\n\n\t");  
      while(temp != NULL) // traverse list & print volue  
      {  
           printf("%c",temp->c);  
           temp=temp->fro;  
      }  
 }  
 check(int m) // funtion check our requrement  
 {  
      node *tf,*tt;  
      tf=head;  
      tt=tell;  
      while(m/2 > 0)   
      {  
           if(tf->c == tt->c)  
           {  
                tf=tf->fro;  
                tt=tt->back;  
           }  
           else  
           {  
           printf("\n\n\t not a palidrome :???");  
           exit(0);  
        }  
        m--;  
      }  
      printf("\n\n\t it is palidrome !!!!");  
 }  

OUTPUT :-