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..)

Redstone--haha. Here's some quick & dirty Java. Hope you get an A because of my work ;-). But boy, there goes my lunch hour+! I'm starving.

But linked lists are fun, haina? Even more fun in C++. You can show off with pointers.

Here's the program in execution. Look at the memory addresses (in hex) to verify how the Nodes are linked. You can even draw a memory diagram based on it, if that helps.

Disclaimer: All characters are fictional. Any resemblance to any persons or situations is merely coincidence :-) [Or maybe not ;-)]

damn bru! what the hell! yo ushould be awarded for sajha computer geek! lol
hehe
it wasn't for me though! it was for dananah! he couldn't post so i posted for him!
hehe

thanks though! damn, tauko dukhyo herda herda!!
babbal cha

hey red hehe...thanks for helping me post..;o) u turned out to be a useful baadar...but a lazy one ...never changed anything ;oP

and Echoes bro...cheers....:o)..i thot so u be helping..next time lunch on me if we ever meet...actually make it few lunches..and few chai :o)...cos it will be me fren payin for it wahahha...he is really grateful and says his thanks..hope he does understand it and can change it hehehe..doin it right now...u saved his life..seriously..echoes bro ta new superman jasto chaa ;o)


dyam i need to learn C++ soon...wanna be me tutor?;oP...and well i let u all know what he got when he gets hs grade...lecturer might suspect him ;oP....

anyways thanks again ..:o)...
have a great day....ma going get screwd..dyam i should have posted me assignment here too..;oP


danny