We introduce novel techniques for organizing the indexing structures of how data is stored so that alterations from an original version can be detectedand the changed values specifically identified. We give forensic constructions forseveral fundamental data structures, including arrays, linked lists, binary searchtrees, skip lists, and hash tables.
