B 4.1.2 Evaluate linked lists (HL Only)
Explore linked lists (singly, doubly, circular), their diagrammatic representation, and core operations: insertion, deletion, traversal, and search. We'll also evaluate their advantages and disadvantages, especially concerning memory use and performance compared to arrays. In computer science, data structures are fundamental ways of organising and storing data to efficiently perform operations on that data. We have...