The Data Structures [You Think You] Need to Know

If you're like most developers, you can get through most of your projects with just lists and maps. Then every once in a while you read a blog post about a mind-blowing problems that can only be solved efficiently because of a data structure you've never heard of, and you wonder where long years of computer science education really got you. Or better yet, maybe you never

The world is full of interesting data structures like Merkel Trees, Bloom Filters, k-d Trees, Ropes, Tries, and just plain old heaps and graphs. Come to this talk for a fun walk through the composition, purpose, and implementation of a few of the data structures you think you need to know–and might actually be able to use!

About Tim Berglund

Tim is a teacher, author, and technology leader with Confluent, where he serves as the Vice President of Developer Relations. He is a regular speaker at conferences and a presence on YouTube explaining complex technology topics in an accessible way. He tweets as @tlberglund, blogs every few years at http://timberglund.com. He has three grown children and two grandchildren, a fact about which he is rather excited.

More About Tim »