Advertisement
Guest User

Untitled

a guest
Mar 22nd, 2019
65
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.22 KB | None | 0 0
  1. #include <iostream>
  2. #include "Header.h"
  3.  
  4. using namespace std;
  5.  
  6. void InserareFata(Nod *&cap)
  7. {
  8. Nod *nod = new Nod;
  9. int valoare;
  10. cout << "valoare nodului este: "; cin >> valoare;
  11.  
  12. nod->val = valoare;
  13. nod->urm = cap;
  14. cap = nod;
  15. }
  16.  
  17. void Afisare(Nod *cap)
  18. {
  19. while (cap != nullptr)
  20. {
  21. cout << cap->val<<" ";
  22. cap = cap->urm;
  23. }
  24. }
  25.  
  26. void AfisareInvers(Nod *cap)
  27. {
  28. if (cap != nullptr)
  29. {
  30. AfisareInvers(cap->urm);
  31. cout << cap->val << " ";
  32. }
  33. }
  34.  
  35. void Testare_Existenta_nr_lista(Nod *cap, int valoare_cautata)
  36. {
  37. int j = 1; int k = 0;
  38. while (cap != nullptr)
  39. {
  40. if (valoare_cautata == cap->val)
  41. j = 0;
  42.  
  43. else
  44. k = 0;
  45.  
  46. cap = cap->urm;
  47. }
  48. if(j==0 and k==0)
  49. cout << "numarul cautat se regaseste printre elementele listei";
  50. else
  51. cout << "numarul cautat nu se regaseste printre elementele listei";
  52. }
  53.  
  54. void Inserare_pozitie_data(Nod *&cap)
  55. {
  56. Nod *nod = new Nod;
  57. int pozitie, valoare, k = 0;
  58. cout << "Introduceti pozitia noului nod: "; cin >> pozitie;
  59. cout << "Introduceti valoarea noului nod: "; cin >> valoare;
  60. while(cap != nullptr)
  61. {
  62. k++;
  63. if (k == pozitie)
  64. {
  65. cap->urm = nod;
  66. nod->urm = cap->urm->urm;
  67. nod->val = valoare;
  68. }
  69. }
  70. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement