Linked List Data Structure 3. Building a Linked List (algorithm and pseudocode).

preview_player
Показать описание
This is the third in a series of videos about the linked list data structure. It describes an algorithm for adding new data items to a linked list in terms of list traversal and Next pointer manipulation. A description of some procedural pseudocode to perform this task is also included, which could be adapted to implement a linked list programmatically.
Рекомендации по теме
Комментарии
Автор

How do you know David comes after Chloe and Beatrix comes before Chloe etc

hashimabbas
Автор

I totally do not understand the pseudocode. Can you please explain it with the exmaples (Chole, F, B, D, E, A)?

What is Data(ptr)?
If Data(ptr) = every data we ask, like when we insert David, data(ptr): Chloe(2), Francis(0), Beatrix(1)????

hkopen
Автор

you're a life saver! thank you very much! :)

kurama
welcome to shbcf.ru