seeing Roberts Post and the help he got..im now inspired to ask for some help too heehehe(why didnt i think of posting earlier ??heheeh) anyways its not for me...its for a fren and he is desperate!!wahahaha..salla kutta due tomorrow re hehe and its easy..but urgh cant spare the time ..got 2 asses due today (ARGHH!!yo VB.NET its fun!;oP and assembly..its gona kill me :oS..)and tomorrow..and been out of practice for a while...its less than an hr work for anyone whos good enuf..(actually i should be emailin this to echoes bro but hehe..that will be too personal ;oP..).. anyways if u can really spare the time..pls help..if not let it be.. Write an implementation of a circular doubly linked list with empty header node. This combination of characteristics should make it easy for you to implement the add() and remove() operations without having to special case being at the start or end of the list. Make sure you implement an Iterator for the list, which supports the remove() operation fully. (Again, the list properties should make it fairly easy to implement remove()). Hints: Having a circularly linked list with an empty header node means that you shouldn't need to make a special case of anything at the start or end of the list. Of course, you will need to modify the helper function getNode(int index) so that it counts correctly, but it can do all the index-out-of-bounds error checking for you. Similarly, a circularly linked list makes it easier to deal with the last element of the list. Having a doubly linked list makes it easier to implement some of the list functions, but at the cost of needing to update two pointers whenever you add or remove a node. didnt i say it was easy?hehehe...la ta gotta rush..lets see what me frens luck is like hehe.. laters all.. danny... (dyam we should stop being lazy and do our work way earlier on time!!!why do we get ourselves into such situations in the 1st place..urghh..)