Download

Double-Linked List

by Thales 2 years, 3 months ago and tagged with: C++ linked-list double 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
 
/**************************/
/* ListaDubluInlantuita.h */
/**************************/
 
#ifndef LISTA_DUBLA
#define LISTA_DUBLA
 
struct nod
{
    nod *llink;
    nod *rlink;
    int info;
};
 
class ListaDubluInlantuita
{
    public:
        nod *FIRST;
        nod *LAST;
 
        ListaDubluInlantuita();
 
        void adaugaInceput(int val);
        void adaugaSfarsit(int val);
        void adaugaDupaNod(nod *dupa, int val);
        void adaugaDupaVal(int dupa, int val);
 
        void stergeNod(nod *rip);
        void stergeVal(int val);
        
 
        void afiseazaSD();
        void afiseazaDS();
};
 
#endif
 
/****************************/
/* ListaDubluInlantuita.cpp */
/****************************/
 
#include "ListaDubluInlantuita.h"
#include <iostream>
 
using namespace std;
 
ListaDubluInlantuita::ListaDubluInlantuita()
{
    FIRST = NULL;
    LAST = NULL;
}
 
void ListaDubluInlantuita::adaugaInceput(int val)
{
    nod *nou = new nod();
    nou -> info = val;
 
    if(FIRST == NULL)
    {
        FIRST = nou;
        LAST = nou;
        nou -> llink = NULL;
        nou -> rlink = NULL;
    }
    else
    {
        nou -> rlink = FIRST;
        nou -> llink = NULL;
        FIRST -> llink = nou;
        FIRST = nou;
    }
}
 
void ListaDubluInlantuita::adaugaSfarsit(int val)
{
    nod *nou = new nod();
    nou -> info = val;
 
    if(LAST == NULL)
        adaugaInceput(val);
    else
    {
        nou -> rlink = NULL;
        nou -> llink = LAST;
        LAST -> rlink = nou;
        LAST = nou;
    }
}
 
void ListaDubluInlantuita::adaugaDupaNod(nod *dupa, int val)
{
    nod *nou = new nod();
    nou -> info = val;
 
    nou -> llink = dupa;
    nou -> rlink = dupa -> rlink;
 
    if(nou -> rlink == NULL)
        LAST = nou;
    else
        dupa -> rlink -> llink = nou;
    dupa -> rlink = nou;
}
 
void ListaDubluInlantuita::adaugaDupaVal(int dupa, int val)
{
    nod *iter = FIRST;
    if(iter == NULL)
        cout << "Lista este vida" << endl;
    while(iter != NULL)
        if(iter -> info == dupa)
        {
            adaugaDupaNod(iter, val);
            break;
        }
        else
            iter = iter -> rlink;
}
 
 
void ListaDubluInlantuita::afiseazaSD()
{
    nod *iter = FIRST;
    if(iter == NULL)
        cout << "Lista este vida" << endl;
    while(iter != NULL)
    {
        cout << iter -> info << " ";
        iter = iter -> rlink;
    }
}
 
void ListaDubluInlantuita::afiseazaDS()
{
    nod *iter = LAST;
    if(iter == NULL)
        cout << "Lista este vida" << endl;
    while(iter != NULL)
    {
        cout << iter -> info << " ";
        iter = iter -> llink;
    }
}
 
void ListaDubluInlantuita::stergeNod(nod *rip)
{
    if(rip -> llink == NULL)
        FIRST = rip -> rlink;
    else
        rip -> llink -> rlink = rip -> rlink;
 
    if(rip -> rlink == NULL)
        LAST = rip -> llink;
    else
        rip -> rlink -> llink = rip -> llink;
 
    delete rip;
}
 
void ListaDubluInlantuita::stergeVal(int val)
{
    nod *iter = FIRST;
    if(iter == NULL)
        cout << "Lista este vida" << endl;
    while(iter != NULL)
        if(iter -> info == val)
        {
            stergeNod(iter);
            break;
        }
        else
            iter = iter -> rlink;
}

Currently 0 comments

To post a comment, you must login.