Data Structures: Linked Lists

Put the return at the end so if you there are any duplicates in the (DeleteWithValue) it wont skip them over.

So is there any memory leak when we delete a node ???

It's much easier to pay attention and understand if you mute the video and play 009 Sound System – Dreamscape in the background.

Any conversation about linked lists should BEGIN with the following warning:

"You probably shouldn't be using a linked list for this."

If I instantiate the node class, wouldn't it go into inifinite recursion when it tries to make an instance of itself at line 2: 'Node next'? Also how is it instantiated without passing in the argument for the constructor?

Great video! I was so confused with Linked Lists in my CS class, but this makes it so simple to understand!

Please warn us before that you are doing that in C++ and not C 🙂

I wished she was my lecturer.. so fluent and to the point ?

little fast

Thank you so much. The visual representation that changes with each new line of code is so helpful for a concept like this. Code for nodes can often look kind of cryptic without a visual representation of how things move.

but how do you reverse a linked list

Карьера Програмиста

nice lect

Why do we need to create current＝head?
What does it do??

Please use dark IDE. It burns my eyes while watching at 2am. Even with the lovest brightnes.

0:21 "They can cOnTaIn

i m not getting it Yet

what actually gets returned in the public void append(int data) method? I'm confused as to why you need the return statement on line 17?

The wrapper class of LinkedList dynamically changes the head by prepending to inform other "lists" pointers. This is really neat! Thank you!

I didn't get it in 3:08 what will make an issue ?

Can you just destroy the “deleted” node by setting it to null

So linked list are actually objects that point to another object? And at 2:30 when you write 'Node next' does the program already know what 'next' does? Is 'Node next' like a method that is predefined within the program??

what that *p,*temp; in the comments of below program ??

struct node{

int item;

struct node *next;

} new_node;

// *p , *head,*temp;

Im sitting for half a year with this and cant do it at all from scratch let alone writing function for it . Everyone have diffirent way of doing this , so i cant really get it how to make it (in C)

That is an amazing explanation. I have two questions
1. Does the deleted node garbage collected?
2. How to delete a node with duplicate data. I.e.If there are multiple nodes with same data and we want to delete the last data Node. ? How do we differentiate the two nodes with same data ?

The only catch is that deleteBtValue won't delete duplicate values.

does anyone know why we have to create "current" instead of using "head" in append?

But what if you want to delete the head and if the head is the only node in the linked list?