Stack

#include <stdio.h>
#include <stdlib.h>
#include <conio.h>
 
typedef int T;
 
struct StackCell{
    T info;
    StackCell *legatura;
 };
 
StackCell *top;
int cSize;
 
void init();
int push(T);
void afisT(T);
void afisare();
T pop();
int isEmpty();
void cinT(T *);
int search(T);
int replace(T,T);
int replaceAll(T,T);
 
 
int main(){
    init();
    T info,info1;
    int opt = 1,flag=1;
    while(opt>0){
        printf(">Optiune:");
        scanf("%d",&opt);
        printf("\n");
        switch(opt){
            case 0:{
                printf("\t>Exit!\n");
                opt=0;
                break;
            }
            add:
            case 1:{
                printf("\t>Adaugare informatii!\n");
                printf("\t>Informatie=");
                cinT(&info);
                if(push(info)){
                    printf("\t>Done\n");
                }else{
                    printf("\t>Error\n");
                }
                break;
            }
            default:{
                printf("\t>Optiune necunoscuta!\n");
                break;
            }
            case 2:{
                printf("\t>Scoate info!\n");
                if(isEmpty()>0){
                    printf("\t>A fost scoasa informatia:");
                    afisT(pop());
                    printf("\n");
                }else{
                    printf("\t>Nu exista exista informatii in lista!\n");
                }
                break;
            }
            case 3:{
                printf("\t>Afisare info!\n");
                if(cSize>0){    
                    printf("\t>Informatii:");
                    afisare();
                    printf("\n");
                    printf("\t>Exista %d informatii in lista!\n",cSize);
                }else{
                    printf("\t>Nu exista info in lista!\n");
                } 
                break;
            }
            case 4:{
                printf("\t>Search info!\n");
                printf("\t>Informatie=");
                cinT(&info);
                int i=search(info);
                if(i>=0){
                    printf("\t>Found!\n\t  >Pe pozitia %d!\n",i);
                }else{
                    printf("\t>Not found!\n");
                }
                break;
            }
            case 5:{
                flag=1;
                printf("\t>Replace info!\n");
                if(cSize>0){
                    while(flag>0){
                        printf("\t>Info initial=");
                        cinT(&info);
                        if(search(info)>=0) flag=0;
                        else{
                            printf("\n\t  >Info initial not found\n\t  >Try again!\n\n");
                        }
                    }
                    printf("\t>Info final=");
                    cinT(&info1);
                    if(replace(info,info1)){
                        printf("\t>Done\n");
                    }else{
                        printf("\t>Error\n");
                    }
                }else{
                    printf("\t>Nu exista info in stiva!\n\t>Adaugati!\n\n\n");
                    goto add;
                }
                break;
            }
        }
        printf("\n");
    }
    getch();
    return 0;
}
 
int replace(T initial,T final){
    StackCell *aux=top;
    int i=0;
    if(search(initial)>=0){
        while(i<search(initial)){
            aux=aux->legatura;
            i++;
        }
        aux->info=final;
        return 1;
    }
    return 0;
}
 
int search(T info){
    StackCell *aux=top;
    int i=0;
    while(aux!=NULL && aux->info!=info && aux->legatura!=NULL){
        aux=aux->legatura;
        i++;
    }
    if(aux->info == info){
        return i;
    }else{
        return -1;
    }
}
 
 
void init(){
    top=NULL;
    cSize=0;
}
 
int push(T info){
    StackCell *aux=new StackCell;
    if(aux==NULL){
        return 0;
    }else{
        aux->info=info;
        aux->legatura=top;
        top=aux;
        cSize++;
        return 1;
    }
}
 
void afisT(T n)
{
    printf("%d ", n);
}
 
void afisare(){
    StackCell *contor=top;
    while(contor!=NULL){
        afisT(contor->info);
        contor=contor->legatura;
    }
}
T pop(){
    T buffer;
    if(top!=NULL){
        buffer=top->info;
        StackCell *aux=top;
        top=aux->legatura;
        delete aux;
        if(cSize>0){
            cSize--;
        }else{
            cSize=0;
        }
        return buffer;
    }
    return -1;
 
}
 
int isEmpty(){
    if(top == NULL) return 0;
    else return 1;
}
void cinT(T *n){
    scanf("%d",n);
}