#### Overview of this book

Golang is one of the fastest growing programming languages in the software industry. Its speed, simplicity, and reliability make it the perfect choice for building robust applications. This brings the need to have a solid foundation in data structures and algorithms with Go so as to build scalable applications. Complete with hands-on tutorials, this book will guide you in using the best data structures and algorithms for problem solving. The book begins with an introduction to Go data structures and algorithms. You'll learn how to store data using linked lists, arrays, stacks, and queues. Moving ahead, you'll discover how to implement sorting and searching algorithms, followed by binary search trees. This book will also help you improve the performance of your applications by stringing data types and implementing hash structures in algorithm design. Finally, you'll be able to apply traditional data structures to solve real-world problems. By the end of the book, you'll have become adept at implementing classic data structures and algorithms in Go, propelling you to become a confident Go programmer.
Preface
Free Chapter
Section 1: Introduction to Data Structures and Algorithms and the Go Language
Data Structures and Algorithms
Getting Started with Go for Data Structures and Algorithms
Section 2: Basic Data Structures and Algorithms using Go
Linear Data Structures
Non-Linear Data Structures
Homogeneous Data Structures
Heterogeneous Data Structures
Dynamic Data Structures
Classic Algorithms
Section 3: Advanced Data Structures and Algorithms using Go
Network and Sparse Matrix Representation
Memory Management
Next Steps
Other Books You May Enjoy

# Heterogeneous Data Structures

Heterogeneous data structures are data structures that contain diverse types of data, such as integers, doubles, and floats. Linked lists and ordered lists are good examples of these data structures. They are used for memory management. A linked list is a chain of elements that are associated together by means of pointers. Each element's pointer links to the following item, which connects the chain together. Linked lists don't have to take up a block of memory. The memory that they utilize can be allocated dynamically. It comprises a progression of nodes, which are the components of the list. Ordered lists and unordered lists from HTML are shown to demonstrate the usage of lists and storage management. We will cover linked lists, ordered lists, and unordered lists in this chapter and show the implementation of their methods with appropriate...