DSA 2024 föreläsning 03 2024-01-26

Thomas Padron-McCarthy · 92:10 · Watch on YouTube

This lecture argues that a circular, doubly linked list with a sentinel node gets rid of almost all the special cases that make linked-list code fragile: first element, last element and empty list. It builds the delet...

Read the full summary on retube

한국어