Abstract
Copying and modifying a branch of a balanced tree, while sharing the unmodified subtrees with the original tree, is a simple and general technique for building many persistent data structures with O(log n) complexities. The lecture will show this technique at work on structures of the " dictionary " type: search trees, prefix trees, and prefix trees with hashing (HAMT).
