一般线性链表类的C++实现(二)

2014-11-24 13:11:00 · 作者: · 浏览: 7
e(4, 40);
cout << l.GetLength() << endl;

int dataTemp = 0;
for (int i = 1; i <= l.GetLength(); i++) {
l.GetNodeData(i, dataTemp);
cout << dataTemp << endl;
}

if (l.SetNodeData(3, 50)) {
cout <<"DONE ";
} else {
cout << "Failed ";
}

for (i = 1; i <= l.GetLength(); i++) {
l.GetNodeData(i, dataTemp);
cout << dataTemp << endl;
}

if (l.DeleteNode(4)) {
cout <<"DONE ";
} else {
cout << "Failed ";
}

for (i = 1; i <= l.GetLength(); i++) {
l.GetNodeData(i, dataTemp);
cout << dataTemp << endl;
}

cout << l.LocateElem(50) << endl;
return 0;
}
*/