# java-datastructure **Repository Path**: Lil-Kr/java-datastructure ## Basic Information - **Project Name**: java-datastructure - **Description**: java datastructure - **Primary Language**: Java - **License**: Not specified - **Default Branch**: main - **Homepage**: None - **GVP Project**: No ## Statistics - **Stars**: 0 - **Forks**: 0 - **Created**: 2023-02-18 - **Last Updated**: 2025-04-28 ## Categories & Tags **Categories**: Uncategorized **Tags**: None ## README English | [简体中文](./README.zh.md) # 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 ```plaintext . ├── 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/ ├── common/ │ └── src/ │ └── main/ │ └── java/com/cy/datastructure/common/ ├── 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/