A list of interesting algorithms and data structures.

• Gap Buffers are simpler than ropes and provide many similar benefits.
  • Of course, you could do a rope of gap buffers if you really wanted to.
• Merkel DAG's are a generalization of the Merkle Tree.
  • IPLD has the updated version of the IPFS merkledag.
• Merkle Trees store hierarchical, content-addressable data.
• Piece Tables represent a series of composable edits to an initial span of text.
  • Here's an interesting thread about Piece Tables
• Ropes binary trees useful for operations on long strings.
• Suffix Trees are tries that contain as their keys every suffix of a given text. They make lots of useful string operations efficient.