Treasure Hunt Adventure | Muhammed Gelgör

Treasure Hunt Adventure is a two-person project for the Data Structures course at Fatih Sultan Mehmet Vakıf University. The goal was to use linked lists and binary search trees inside a real, playable game instead of a console exercise.

The game

Players enter a username, roll a virtual die, and move along a board path. Each spot changes the score:

treasure chest: +10 points
trap: -5 points
empty spot: no change
move forward / move backward (level 2 only)

The data structures

Each level’s board is a doubly linked list of spots: 30 nodes in level 1 and 40 in level 2. The map is generated at runtime with treasures and traps placed randomly, and moving backward simply walks the Prev pointers.

Level 1 board: a looping path of treasure and trap tiles on an island, with a die and the score — Level 1: a 30-spot path generated as a doubly linked list.

Level 2 board on a stormy background with numbered tiles and move-forward and move-backward spots — Level 2 adds action spots that move the player forward or backward.

Final scores are saved to a file. The scoreboard reads them back into a binary search tree where each node holds a username, level, and score, then uses in-order traversal plus minimum and maximum lookups to show a player’s scores, best run, and worst run.

Read the project report.