LinkedList 13 Circular Linked Lists

preview_player
Показать описание
Dr. Rob Edwards from San Diego State University discusses ways to determine whether linked lists are linear or circular.
Рекомендации по теме
Комментарии
Автор

First 5 minutes I was more confused about how he was writing backwards than the linked lists

Submersed
Автор

Very helpful, but still more impressed by how smoothly you write backwards XD

MKOVjinchuriki
Автор

For those of you wondering:
He isn't drawing backwards, he's just writing normally and the video image is flipped...

Mnat
Автор

in you last example where the supposed tail is not pointing at the head but to other nodes. How will you know when to increment the head? the head.next as your current head? As you have said it without the tail pointer it will keeps looping

jijoet
Автор

Great explanation!!! Thank you Professor sir!!!

kapztcs
Автор

Why making the temp pointer? Tail == head is enough to see if it loops or not

NarutoSSj
Автор

great explanation- However, it is hard for me, extremely hard to write in C language. Don't know how to write a simple linked list. I copy the code from textbooks since all of the code is similar but it is still hard to grasp it. How long will it take me to learn it on my own? ? ??

cortz
Автор

how to use stack using circular linked list ?

fernandoyogaa
Автор

When you notice that the guy actually can write in mirror writing. 🤯

hopeman