Linked Lists Introduction

preview_player
Показать описание
Related videos:

Data Structures Source Code:

Рекомендации по теме
Комментарии
Автор

At 13:00, I would like to point out that for Singly Linked List, insertion at tail only takes O(1) if we have a pointer to the tail. Otherwise, it is O(n) to insert at the end, since we need to traverse from head to tail to insert at the end.

Mydad-etel
Автор

Note that Singly Linked List also can have Head and Tail Node, But only one pointer to next node. When remove at tail in Singly, We can remove last Node using Tail Node. But Tail Node doesn't know what is previous Node only know next is NULL. So we have to throw away Tail node after removing that.

JIHYELEE-hm
Автор

Do you have a video on floyd's cycle detection algorithm? If not will you please do one.

sanskarsoni
Автор

if an n-1th element needs to be deleted in case of deletion from the middle in a doubly linked list, why can't we use the tail pointer and prevent the O(n) traversal? I think time complexity is O(n/2) since we must have to traverse in case the middle element in the list has to be deleted.

anupampandey
Автор

I'm 1:27 into this vid and I've already seen 2 advertisements. Truly ruining my experience.

edit: 5:27 and the 3rd ad. Youtube is commiting suicide. Got to get off this platform.

marlonstevenson