How would you design a lock-free data structure in a language
without a garbage collector? With a garbage collector? How would you
implement a linked list, an array, and a hashmap lock-free?
What is branch prediction? What are some ways to speed up code that
is inherently branchy?