Skip to content

Latest commit

 

History

History
32 lines (28 loc) · 862 Bytes

README.md

File metadata and controls

32 lines (28 loc) · 862 Bytes

Go Concurrent-Safe Data Structures

This project implements various data structures and algorithms in Go. Since Go has limited built-in support for data structure operations, the API is inspired by Rust's collections and iterator trait APIs.Additionally, many of Go's built-in data structures are not inherently thread-safe, so I've included a mutex in each data structure to ensure concurrent safety.

List

  • Array List
  • Single Linked List
  • Double Linked List

Map

  • Hash map
  • Bi-directional Hash Map
  • Tree Hash Map
  • Bi-directional Tree Map

Queue

  • Array Queue
  • Circular Queue
  • Linkedlist Queue
  • Priority Queue

Stack

  • Array Stack
  • Linkedlist Stack

Sets

  • Hash Set
  • Linked Hash Set
  • Tree Set

Trees

  • AVL Tree
  • Binary Heap
  • BTree
  • Red Black Tree