Loading page…
Kestrel Chat needs a thread where messages join at the end, jump to the front and leave from anywhere. An array shifts every value for a change at the front; a linked list keeps each value in its own node and changes a pointer or two. The lecture shows the list in memory, every operation step by step with its cost in pointer hops, when to choose a list over an array, and the classic mistakes.
A chat thread can hold fifty thousand messages.