As someone who studied abstract data types in 1990 I have found at least two new types not taught then that have since become a lot more mainstream:

  • Bloom filters: a space-efficient probabilistic data structure, conceived by Burton Howard Bloom in 1970, that is used to test whether an element is a member of a set.
  • Skip lists: a data structure that allows fast search within an ordered sequence of elements. Fast search is made possible by maintaining a linked hierarchy of subsequences
    Julian Climate Crisis Harris

    Written by

    Technical Product guy specialising in the impact of machine learning on speech and text (NLP). Ex-Google, but none of this matters if we don't fix the planet.