Google.
C++ LL. That's more detailed than I think it needs to be.
Look at the delete beginning node and delete end node functions. A combination of both does a general delete. Find the node you want to delete. use the begin node delete method on it. Find the node before the node (it's the one that points to this one as next) that you want to delete (one way link list means search from beginning) and make it point to the new next node.
Insert is easy. Find where you want to insert. Create the new node. Make node before insertion point to it, make new node point to what the before node pointed to before.
Done.
Processor(s):
Intel Core 2 Duo T8100 | Motherboard:
Mobile Intel PM965 Express Chipset | RAM Memory:
1024 + 2048MB DDR2 667 | Graphics Card(s):
ATI HD 2600 XT |
Sound Card:
Toshiba Bass Enhanced Sound System | Hard Drive(s):
200GB 5400RPM | Optical Drive(s):
DVD Super Multi | Case / PSU:
Satellite A200 Series |
Cooling:
Stock | Network / Internet:
Intel 4965AGN | Monitor(s):
15.4" 1,280x800 Toshiba TruBrite | Operating System(s):
Windows Vista SP1 / Fedora i386 |
31st May 2009, 02:04
Similar Threads 
