Advertisement
Five_NT

[C++]Lista simpla, dubla, circulara

May 5th, 2014
265
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 1.52 KB | None | 0 0
  1. /* Lista dubla */
  2. void creare() {
  3.     p = new nod;
  4.     prim = p;
  5.     cout<<"Dati informatia nodului: ";
  6.     cin>>p->info;
  7.     p->urm = NULL;
  8.     while(p->info != 0) {
  9.         u = new nod;
  10.         cout<<"Dati informatia: ";
  11.         cin>>u->info;
  12.         p->urm = u;
  13.         p = u;
  14.     }
  15.         p->urm = NULL;
  16. }
  17.  
  18. void afis_sd() {
  19.     p = prim;
  20.     while(p->urm != NULL) {
  21.         cout<<p->info<<" ";
  22.         p = p->urm;
  23.     }
  24. }
  25. /* ******************************************* */
  26. /* Lista dubla */
  27. void creare()
  28. {
  29.     p = new nod;
  30.     prim = p;
  31.     cout << "Dati informatia nodului: ";
  32.     cin >> p -> info;
  33.     p -> ant = NULL;
  34.  
  35.     while(p -> info) {
  36.         u = new nod;
  37.         cout << "Dati informatia nodului: ";
  38.         cin >> u -> info;
  39.         p -> urm = u;
  40.         u -> ant = p;
  41.         p = u;
  42.     }
  43.     p -> urm = NULL;
  44. }
  45.  
  46. void afisare_sd() {
  47.     p = prim;
  48.     while(p -> urm != NULL) {
  49.         cout << p -> info << " ";
  50.         p = p -> urm;
  51.     }
  52. }
  53.  
  54. void afisare_ds() {
  55.     p = u -> ant;
  56.     while(p != NULL) {
  57.         cout << p -> info << " ";
  58.         p = p -> ant;
  59.     }
  60. }
  61. /* ******************************************* */
  62. /* Lista circulara */
  63. void creare()
  64. {
  65.     p = new nod;
  66.     cout << "Dati informatia nodului: ";
  67.     cin >> p -> info;
  68.     p -> urm = NULL;
  69.     prim = p;
  70.     while(p -> info) {
  71.         u = new nod;
  72.         cout << "Dati informatia nodului: ";
  73.         cin >> u -> info;
  74.         p -> urm = u;
  75.         p = u;
  76.     }
  77.     p -> urm = prim;
  78. }
  79.  
  80. void afisare_sd() {
  81.     p = prim;
  82.     while(p -> urm != u -> urm) {
  83.         cout << p -> info << " ";
  84.         p = p -> urm;
  85.     }
  86. }
  87. /* ******************************************* */
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement