Persistant Data Structures - Lecture 1
The first lecture on persistent data structures was like stepping into a time machine for data, where every change creates a new version without erasing the old ones. It's like having an undo button that doesn’t stop at just one undo – it's the Git of data structures! In this class, we learned how persistent data structures let us retain previous versions of data even after modifications, making it a playground for historians and cautious coders alike. It's as if your data is telling stories about its own evolution ------------------------------------------------------------------------------------------- 1. Partial Persistent Data Structure: this is a type of DS, whereby we can store different versions of our data, but the catch is that we can only update the latest version of the data. code Implementation description: persistent data structure using linked lists ( PPDS ). It allows for efficient insertion and deletion operations while preserving previous versions of dat...