Skip to content

Latest commit

 

History

History
4 lines (4 loc) · 290 Bytes

File metadata and controls

4 lines (4 loc) · 290 Bytes

Super_Hangman_World

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.