Односвязные списки

#include<iostream.h>
#include<stdlib.h>
#include <conio.h>
struct cell {
    char sign[10];
    char weight;
    struct cell *next;
};
void main ()
{
clrscr();
    struct cell *tmp; 
    struct cell *head = NULL; 
    struct cell *ends = NULL; 
cout << "Vvedite stroky, okanchiv. tochkoi :\n";
    
    do
    {
        
        tmp = new struct cell;
        
        
        cin >> tmp -> sign;
        
        cin >> tmp -> weight;
if (tmp -> weight == '.')
        {
            delete tmp;
            break;
        };
        
        if (head == NULL && ends == NULL)
        
            head = tmp;
        else
            ends -> next = tmp;
ends = tmp;
        ends -> next = NULL;
    } 
    while (1); 
    cout << "Spisok:\n";
    tmp = head;
    while (tmp != NULL)
    {
        cout << tmp -> sign << " "<<tmp -> weight<<" ";
        tmp = tmp -> next;
    }
cout<<endl<<"obrabotanii spisok"<<endl;
tmp = head;
    while (tmp != NULL)
    {
        if (tmp -> weight == 'a')   
            {
            
            tmp -> weight = '0';
            cout<<tmp -> weight<<" ";
            tmp = tmp -> next;
            
            }
            else
            {
            
            cout<<tmp -> weight<<" ";
            tmp = tmp -> next;
            
            }
    }
    
tmp = head;
    while (tmp != NULL)
    {
        if (tmp == ends)
            ends = tmp -> next;
        head = tmp -> next;
        delete tmp;
        tmp = head;
    }
getch ();
}

#include <iostream>
 
typedef struct Node {
    Node *next;
    char weight;
    char sign[10];
};
 
Node* insert( Node *current, Node *next ){
    current->next = next;
    current = next;
    return current;
}
 
void print( const Node *root ){
    Node *current = (Node*)root;
    while ( current != NULL ){
        std::cout << current->sign << " " << current->weight << std::endl;
        current = current->next;
    }
}
 
void remove( const Node *root ){
    Node *current = (Node*)root, *temp = NULL;
    while ( current != NULL ){
        temp = current;
        current = current->next;
        delete temp;
    }
}
 
Node* replace( Node *root ){
    Node *current = root;
    while ( current != NULL ){
        if ( current->weight == 'A' || current->weight == 'a' ){
            current->weight = '0';
        }
        for ( int i = 0; i < 10; i++ ){
            if ( current->sign[i] == 'A' || current->sign[i] == 'a' ){
                current->sign[i] = '0';
            }
        }
        current = current->next;
    }
    return root;
}
 
int main(int argc, char *argv[]){
    Node *root = NULL, *current = NULL;
    char weight, sign[10];
    std::cout << "Enter an items of an array: " << std::endl;
    do {
        std::cout << "Enter [sign]: ";
        std::cin >> sign;
        std::cout << "Enter [weight]('.' to break): ";
        std::cin >> weight;
        if ( weight == '.' ){
            break;
        }
        if ( root == NULL ){
            root = new Node;
            root->next = NULL;
            memcpy( root->sign, sign, 10 );
            root->weight = weight;
            current = root;
        } else {
            Node *node = new Node;
            node->next = NULL;
            memcpy( node->sign, sign, 10 );
            node->weight = weight;
            current = insert( current, node );
        }
    } while( 1 );
    std::cout << "Normal linked list: " << std::endl;
    print( root );
    root = replace( root );
    std::cout << "Replaced linked list: " << std::endl;
    print( root );
    remove( root );
    system( "pause" );
    return 0;
}