This game was developed in a binary search tree, each tree node represents a stage of the game , if the player lose a stage he is sent to a more easy stage, if the player win, he is sent to a more hard stage. When all the tree finish the game ends.
-
Notifications
You must be signed in to change notification settings - Fork 0
UniversityOfBrasilia/UNB-ProgrammingParadigms-2014.2-Super_Hangman_World
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published