C++

Forum

 
singly linked list and doubly linked list

firix (438)
Hi everyone,
I have configured singly linked list and doubly linked list but I could not understand the following concepts.Could you explain briefly with an example this concepts to me?



1.Intrusive singly linked list
2.Intrusive doubly linked list

thanks in advance...
Last edited on
firix (438)
thanks, but I have looked already at them...



question:
Write intrusive and nonintrusive doublylinked lists.What operations should be provided
in addition to the ones you found necessary to supply for a singly linked list?
Zaita (2770)
Some more reading that will be helpful:

http://www.systomath.com/include/Boost-1_35/doc/html/intrusive/intrusive_vs_nontrusive.html
http://stackoverflow.com/questions/3819816/intrusive-or-non-intrusive

We're more about pointing you in the right direction to learn what you need. This will help you be a better programmer than if we just gave you the answers.

Edit: You also haven't given us your code for one of your lists so we can see how you implemented it.
Last edited on
firix (438)
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
175
176
177
178
179
180
181
182
183
184
185
186
187
 
template<class T>
class List{
public:
	struct node{
	T  val;
	node *pnext;
	node *prev;
	node()
	{	
		pnext = 0;
		prev = 0;
	}
};
	node *phead;
	node *ptail;
	size_t count;
	List<T>()
	{
		phead = 0;
		ptail  = 0;
		count = 0;
	}               
node *AddlistnodeHead(T val)
{
	node *pnewnode = new node;
	pnewnode->val = val;
	pnewnode->pnext = 0;
	pnewnode->prev = 0;

	pnewnode->pnext = phead;

	if (count >= 1) {
		pnewnode->pnext = phead;
		phead->prev = pnewnode;
	}


	phead = pnewnode;
	if (ptail == 0)
		ptail = pnewnode;
	count++;

	return pnewnode;

}

node *AddlistnodeTail(T val)
{
	node *pnewnode = new node;
	pnewnode->pnext = 0;
	pnewnode->prev = 0;

	pnewnode->val = val;

	if (ptail == 0) {
		ptail = pnewnode;
		phead = pnewnode;
	}
	else 
	{
		pnewnode->prev = ptail;
		ptail->pnext = pnewnode;
		ptail = pnewnode;

	}

	count++;


	return pnewnode;
}



node *insert_node(node *pnode, T val)
{
	node *pnewnode = new node;
	pnewnode->pnext = 0;
	pnewnode->prev = 0;
	pnewnode->val =val;

	if (ptail == pnode) {
		pnewnode->prev = ptail;
		ptail->pnext = pnewnode;
		ptail = pnewnode;
	}

	else if (count == 1) {
		ptail->pnext = pnewnode;
		pnewnode->prev = ptail;
		ptail = pnewnode;
	}
	else {
	
	pnewnode->pnext = pnode->pnext;
	pnewnode->prev = pnode;
	pnewnode->pnext->prev = pnewnode;
	pnode->pnext = pnewnode;
	}

	
	count++;
	return pnewnode;
}

node *insert_node_index(size_t index, T val)
{
	node *pnode;

	if (index == 0)
		return AddlistnodeHead(val);


	pnode = phead;

	for (int k = 0; k < index - 1; ++k)
		pnode = pnode->pnext;

	return insert_node(pnode, val);



}


void delete_node(node *pnode)
{
	node *ptemp;

	if (count == 1) {
		ptemp = pnode;
		pnode = 0;
		ptail = 0;
	}


	else {
	ptemp = pnode->pnext;

	if (ptail == ptemp)
		ptail = pnode;
	pnode->pnext = ptemp->pnext;
	ptemp->prev = pnode;
	}
	--count;

	delete ptemp;


}

bool delete_node_index(size_t index)
{
	
	node *pnode, *ptemp;

	pnode = phead;
	if (index >= count)
		return false;

	ptemp = phead;
	//if (count == 1) {
	//	ptail = 0;
	//	phead  = 0;
	//	delete ptemp;
	//	return true;
	//}

	if (index == 0) {
		phead->prev = 0;
		phead = phead->pnext;
		delete ptemp;
		--count;
		return true;

	}

		for (int i= 0; i < index -1; ++i)
			pnode = pnode->pnext;
		delete_node(pnode);

		return true;

}

};
Last edited on
Topic archived. No new replies allowed.