Pergunta de entrevista da empresa Hillcrest Labs

The most difficult question asked about the best data structure to store temporal data that is constantly being acquired and consumed. Unless you had encountered this before, you might gravitate towards a naive linked-list solution, or else try to use some kind of tree. We were asked to consider the running times for the storage and retrieval operations, and I was able to keep the conversation going as I was thinking about my answer by rattling off my pre-existing knowledge of data structures and their running times.