Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include "Header.h"
- using namespace std;
- void InserareFata(Nod *&cap)
- {
- Nod *nod = new Nod;
- int valoare;
- cout << "valoare nodului este: "; cin >> valoare;
- nod->val = valoare;
- nod->urm = cap;
- cap = nod;
- }
- void Afisare(Nod *cap)
- {
- while (cap != nullptr)
- {
- cout << cap->val<<" ";
- cap = cap->urm;
- }
- }
- void AfisareInvers(Nod *cap)
- {
- if (cap != nullptr)
- {
- AfisareInvers(cap->urm);
- cout << cap->val << " ";
- }
- }
- void Testare_Existenta_nr_lista(Nod *cap, int valoare_cautata)
- {
- int j = 1; int k = 0;
- while (cap != nullptr)
- {
- if (valoare_cautata == cap->val)
- j = 0;
- else
- k = 0;
- cap = cap->urm;
- }
- if(j==0 and k==0)
- cout << "numarul cautat se regaseste printre elementele listei";
- else
- cout << "numarul cautat nu se regaseste printre elementele listei";
- }
- void Inserare_pozitie_data(Nod *(*cap), Nod *(*nou_nod))
- {
- int pozitie, valoare, k = 0;
- cout << "Introduceti pozitia noului nod: "; cin >> pozitie;
- cout << "Introduceti valoarea noului nod: "; cin >> valoare;
- while(cap != nullptr)
- {
- k++;
- if (k == pozitie)
- {
- cap.urm = nou_nod;
- nou_nod.urm = cap.urm->urm;
- nou_nod.val = valoare;
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement