I see it time and again in Google interviews or new-grad hires: The way data structures and algorithms ... When do you want a tree? When is a min-heap the right solution?