This repository is a collection of data structures studied and implemented during Computer Science coursework. The goal is to keep the implementations organized by language, with clean source code, build instructions and short documentation for each structure.
| Area | Project | Language | Concepts |
|---|---|---|---|
| Trees | B+ Tree | Java | insertion, deletion, split, redistribution, concatenation, linked leaves |
| Trees | Binary Digital Tree | Java | binary codes, file records, tree compaction, decoding |
| Trees | Patricia Tree | Java | trie structure, word insertion, level traversal |
| Trees | Patricia Trie Alternative | Java | compressed trie, search, prefix handling, level traversal |
| Trees | N-ary Tree with Linked Lists | Java | node keys, linked lists, child links, level traversal |
| Compression | Huffman Tree | C++ | binary tree, ordered lists, frequency table, file compression |