English | 简体中文

Introduction

• This is a personal notes repository, recording the process of learning data structures.
• All data structures are implemented from scratch in Java.

Implemented Data Structures

• Dynamic Array
• Linked List, Doubly Linked List
• Stack, Queue, Heap, Priority Queue
• Binary Search Tree
• Segment Tree, Trie
• Balanced Trees: AVL Tree, Red-Black Tree (insertion operations)
• Hash Table

---

Project Structure

.
├── common/
│   └── src/
│       └── main/
│           └── java/com/cy/datastructure/common/
├── array/
│   └── src/
│       └── main/
│           └── java/com/cy/datastructure/array/
├── avl-tree/
│   └── src/
│       └── main/
│           └── java/com/cy/datastructure/datastructure/avl/
├── binary-search-tree/
│   └── src/
│       └── main/
│           └── java/com/cy/datastructure/datastructure/bst/
├── hashtable/
│   └── src/
│       └── main/
│           └── java/com/cy/datastructure/hashtable/
├── heap-and-priority-queue/
│   └── src/
│       └── main/
│           └── java/com/cy/datastructure/heapandpriorityqueue/
├── linked-list/
│   └── src/
│       └── main/
│           └── java/com/cy/datastructure/linkedlist/
├── red-black-tree/
│   └── src/
│       └── main/
│           ├── java/com/cy/datastructure/redblacktree/
│           └── resources/
│               └── pride-and-prejudice.txt
├── segment-tree/
│   └── src/
│       └── main/
│           └── java/com/cy/datastructure/segmenttree/
├── set-and-map/
│   └── src/
│       └── main/
│           └── java/com/cy/datastructure/setandmap/
├── stack-and-queue/
│   └── src/
│       └── main/
│           └── java/com/cy/datastructure/stackandqueue/
└── trie/
│   └── src/
│       └── main/
│           └── java/com/cy/datastructure/trie/
└── union-find/
│   └── src/
│       └── main/
│           └── java/com/cy/datastructure/unionfind/
├── graph/
   └── src/
       └── main/
           └── java/com/cy/datastructure/graph/

Test cases are written for each structure

---

Future Plans

• Implement more data structures
• Improve test coverage and add documentation for each data structure
• Consider creating a TypeScript version of the data structures repository