In the previous chapter, we discussed composite data types, which are constructed using the struct keyword, and JSON and XML processing in Go, as well as topics such as regular expressions, pattern matching, tuples, runes, strings, and the unicode and strings standard Go packages. Finally, we developed a simple key-value store in Go.
There are times, however, when the structures offered by a programming language will not fit a particular problem. In such cases, you will need to create your own data structures to store, search, and receive your data in explicit and specialized ways.
Consequently, this chapter is all about developing and using many famous data structures in Go, including binary trees, linked lists, hash tables, stacks, and queues, and learning about their advantages. As nothing describes a data structure better than an...