Short introduction to doubly linked lists

Check out our Discord server: / discord

[@botobeni]

The few ppl that need this stuff very much appreciate your channel!

[@alemon9727]

Indeed we do!!

[@reddy2822]

shout out from 42 Nice

[@zouzou6164]

Advantage of double-linked lists: Can keep a track of previous pointers, and make loops more easier to handle. Disadvantage: Takes more memory consumption, since you need to store a previous AND a next. Could be more confusing to understand and add nodes too Here's what i think that are advantages/disadvantages of double-linked lists! Please correct me CodeVault if i got some wrong!

[@CodeVault]

Yep, that's pretty good. Good job!

[@lucasferrini7063]

I think that being able to iterate in both directions is quite useful. There are some cases where being able to only go to the next node is not efficient. Imagine having to print the reversed list. The only way to do something like that (at least what i can come up with right now) includes using recursive functions, which can be bad if you have a large list. You can also halve the time and processing it takes to iterate over the list, since you can start from either side). At least on a simple thought. Amazing series btw, it helped me a lot to get going with my own linked list

[@animeshsarkar295]

Removing of a node need only one pointer while in singly link list we need two pointers, There more advantages but this I found interesting. Thank you for providing useful contents.

[@jovenesmockusfajardo]

In the video when you say Tail are you referring to Head and vice versa? At some point you said: before (previous) Tail there is nothing then NULL

[@victorsenaxD]

1 Question: this type of list should be ordered to be useful?

[@CodeVault]

Probably not. A tree or a simple array would be more useful if it was ordered. This list is nice if you need to append/prepend/delete elements in constant time