LinkedList From Scratch PART 2 - C# C Sharp Visual Studio 2010

[mindprism]

To simplify many functions: Node getNode(int idx); // code first and private int _length; // maintain throughout --- interface object LinkedList.remove(int idx); //should throw an exception instead of returning null -- or -- the sig should be bool remove(int idx, out object o); which does nada to o when out of bounds -- bool replace(int idx, object oNew, out oOld); and you also forgot the major function: LinkedList append(LinkedList l); // return this

[domaine75atutube]

thank you very much for this video

I really love it.

this teaches me a lot.

and congcrat for being a partner. This is much better when you can upload 20 minute video.

to remind you this is how to write getter and setter: public int Id { get; set;}

[domaine75atutube]

thank you very much for this video

I really love it.

this teaches me a lot.

and congcrat for being a partner. This is much better when you can upload 20 minute video.

[riddion2]

I noticed that the getEntry function in the LinkedList class will always return the first node since you just call the getNextNode function and not assign it's return value to currentNode.

But other than that I was surprised that it was this easy.

Thanks.

[daoping]

Kinda off-topic but, are you a partner? Cause this video is 24 minutes long

[QuackWare]

@daoping Yeah I was recently accepted into the partner program, all thanks to my viewers and subscribers!