Go, designed by Google, is a modern, open-source language known for its simplicity, readability, and efficiency. It excels at building web applications, network tools, and cloud services. Its clear syntax and built-in concurrency features make it a popular choice for modern developers. This guide simplifies the basics by introducing arrays, lists, stacks, queues, maps, trees, and graphs in a practical way. Get hands-on experience, understand essential operations, and compare strengths and weaknesses. Perfect your skills with searching, sorting, and efficient data retrieval techniques. Traverse graphs and trees with ease, all illustrated in the Go code for real-world application, and conclude with insights for ongoing learning. After reading this book, the reader can determine when and why specific data structures should be used and when an algorithm best fits the actual problem’s solution.

• Cover
• Title Page
• Copyright Page
• Dedication Page
• About the Author
• About the Reviewer
• Acknowledgement
• Preface
• Table of Contents
• 1. Fundamentals of Data Structures and Algorithms
  • Introduction
  • Structure
  • Objectives
  • Fundamentals of data structures
  • Characteristics of data structures
  • Memory representation
  • Structures in Go
  • History of algorithms
  • Fundamentals of algorithms
  • Representation of algorithms
  • Classification of algorithms
  • Algorithmic complexity and O-notation
  • Functions in Go
  • Data structures and algorithms
  • Conclusion
  • Points to remember
  • Multiple choice questions
  • Answers
  • Questions
  • Key terms
• 2. Arrays and Algorithms for Searching and Sorting
  • Introduction
  • Structure
  • Objectives
  • Arrays
  • Operations
    • Arrays in Go
  • Slices
    • Slices in Go
  • Multidimensional arrays
  • Methods and interfaces in Go
    • Methods
    • Interface
  • Searching algorithms
    • Sequential search
    • Binary search
    • Searching algorithms in Go
  • Sorting algorithms
    • Insertion sort
    • Selection sort
    • Bubble sort
    • Quick sort
    • Sorting algorithms in Go
  • Conclusion
  • Points to remember
  • Multiple choice questions
  • Answers
  • Questions
  • Key terms
• 3. Lists
  • Introduction
  • Structure
  • Objectives
  • Lists
  • Types of lists
  • Operations
  • Implementation of single-linked list
  • Lists versus arrays
  • Lists in Go
    • Double-linked list
    • Circular list
  • Conclusion
  • Points to remember
  • Multiple choice questions
  • Answers
  • Questions
  • Key terms
• 4. Stack and Queue
  • Introduction
  • Structure
  • Objectives
  • Stack
    • Operations
    • Stack in Go
    • Stack implementation
  • Queue
    • Operations
    • Queue implementation
    • Priority queue
    • Priority queue in Go
  • Conclusion
  • Points to remember
  • Multiple choice questions
  • Answers
  • Questions
  • Key terms
• 5. Hashing and Maps
  • Introduction
  • Structure
  • Objectives
  • Hashing
    • Hash function
    • Hash collision
  • Maps
    • Operations
    • Maps in Go
  • Conclusion
  • Points to remember
  • Multiple choice questions
  • Answers
  • Questions
  • Key terms
• 6. Trees and Traversal Algorithms
  • Introduction
  • Structure
  • Objectives
  • Fundamentals of trees
  • Binary tree
    • Operations
  • Trees in Go
    • Insert operation
    • Delete operation
  • Traversal algorithms
    • Preorder
    • Inorder
    • Postorder
    • Level-order
  • Sorting an array with a tree
  • Conclusion
  • Points to remember
  • Multiple choice questions
  • Answers
  • Questions
  • Key terms
• 7. Graphs and Traversal Algorithms
  • Introduction
  • Structure
  • Objectives
  • Fundamentals of graphs
  • Operations
  • Graphs in Go
  • Traversal algorithms
    • Breadth-first search
    • Depth-first search
  • Spanning tree
    • Prim’s algorithm
    • Kruskal’s algorithm
  • Transitive closure
  • Shortest paths
    • Floyd’s algorithm
    • Dijkstra’s algorithm
  • Flow in graphs
    • Ford-Fulkerson algorithm
  • Topological sorting
  • Critical path
  • Conclusion
  • Points to remember
  • Multiple choice questions
  • Answers
  • Questions
  • Key terms
• Index