Book Image

Learn Data Structures and Algorithms with Golang

By : Bhagvan Kommadi
Book Image

Learn Data Structures and Algorithms with Golang

By: Bhagvan Kommadi

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.
Table of Contents (16 chapters)
Free Chapter
1
Section 1: Introduction to Data Structures and Algorithms and the Go Language
4
Section 2: Basic Data Structures and Algorithms using Go
11
Section 3: Advanced Data Structures and Algorithms using Go

Linked lists

A linked list is a linear collection of elements with information. The linked list shrinks or expands based on whether the components are to be included or removed. This list can be small or enormous, yet, regardless of the size, the elements that make it up are straightforward. Linked lists were covered in Chapter 3, Linear Data Structures. They consume more memory than arrays. Reverse traversing is a problem for singly linked lists because a singly linked list points to the next node forward. The next section explains how to reverse a singly linked list with a code example.

Singly, doubly, and circular-linked lists will be covered in this chapter.

Singly linked lists

A singly linked list is a dynamic data structure...