With that, we conclude this chapter on queues. We learned about simple, priority, and circular queues and it's double-ended variant. We also learned when to apply them based on use cases and we saw with example, how we can leverage the power of benchmarking any algorithm or data structure as needed. In the next chapter, we will be putting sets, maps, and hashes under the microscope to understand their internal workings and see what situations they can be useful in.