Summary
In this chapter, we discussed two important data structures, namely, stacks and queues. We have seen how these data structures closely mimic stacks and queues in the real world. Concrete implementations, together with their varying types, were explored. We later applied the concepts of stacks and queues to write real-life programs.
We will consider trees in the next chapter. The major operations on trees will be discussed, along with the different spheres of application of this data structure.
