This thesis presents persistence in data structures, where, unlike conventional ephemeral structures, old data is not lost. We have shown several ways of achieving two different levels of persistence, one where we can only see the old versions, and the other where we can modify them. We focused on achieving persistence in the binary search tree. We have also looked for different possible uses of persistent data structures and implemented a structure such that it solves one of these possible uses.
|