Liste Simplu Inlantuite

#include <stdio.h>
#include <conio.h>
#include <stdlib.h>

typedef struct nodd {

	int x;
	nodd *next;

};

nodd *first, *last;

nodd *alocare() {
	return (nodd*)malloc(sizeof(nodd));
}

void read(int n) {
	first = alocare();
	last = first;
	last->next = NULL;
	printf("Persoana nr.#1 are varsta de: ");
	scanf_s("%d", &last->x);
	nodd *newNod;
	for (int i = 1; i < n; i++) {
		newNod = alocare();
		printf("Persoana nr.#%d are varsta de: ", i + 1);
		scanf_s("%d", &newNod->x);
		last->next = newNod;
		last = newNod;
		last->next = NULL;
	}
}

void show() {
	nodd *actualNode;
	actualNode = first;
	for (int i = 0; actualNode != NULL; i++) {
		printf("\nPersoana nr.#%d are varsta de:  %d .", i+1,actualNode->x);//*actualNode==actualnode->y(adica primul element din structura)
		actualNode = actualNode->next;

	}
}

void fuckMyLife() {
	nodd *preFirst;
	preFirst = alocare();
	preFirst->next = first;
	printf("\nPersoana nr.pre1 are varsta de: \n");
	scanf_s("%d", &preFirst->x);
	first = preFirst;
}

void FuckMyLifeS() {
	nodd *postLast;
	postLast = alocare();
	last->next = postLast;
	printf("\nIntroduceti varsta ultimei persoane din lista: \n");
	scanf_s("%d", &postLast->x);
	postLast->next = NULL;
	last = postLast;
}

void FuckMyLifeSS() {
	nodd *search, *newNodd;
	newNodd = alocare();
	search = first;
	int val;
	printf("\nDupa ce varsta vreti sa adagati noua varsta?\n");
	scanf_s("%d", &val);

	for (int i = 0; search != NULL; i++) {
		if (search->x == val) {

			printf("\nIntroduceti varsta persoanei: \n");
			scanf_s("%d", &newNodd->x);
			newNodd->next = search->next;
			search->next = newNodd;
			break;
		}
		search = search->next;
	}
}

void main() {
	int n;
	printf("Introduceti numarul de noduri ale listei: \n");
	scanf_s("%d", &n);

	read(n);
	printf("\nAfisare lista:");
	show();
	printf("\nIntroduceti varsta persoanei care va lua locul celei din-tai: \n");
	FuckMyLifeSS();
	show();

	_getch();
}