These are C-ish (mostly C with some light C++ flavoring) tutorials for DSA learning in low-level languages.

• BST - Binary Search Tree - learning only.
• Fib - Compute ntn Fibonacci number, recursive and memoized - learning only.
• MaxHeap - Maximum heap (top-k items, or PQ) - learning but can be extended to store KV pairs.
• RingBuffer - A fairly good (and fast) circular buffer of bytes.
• Sudoku - A 9x9 Sudoku board solver using recursion/backtracking.

Licensed under CC0 1.0 Universal -- Do whatever you want except claiming this work your own.