A program written in C that implements many operations of Hashtables, Linked-Lists and Binary Sorted Trees (BST) based on trojan war events.
Operations of Linked-Lists and Binary Sorted Trees (BST) implemented:
- Create
- Insert
- Delete
- Update
- Move
- Create
Every event that occurs is represented by a letter of the alphabet and it is read from the tests files.
Events:
- R: Register soldier
- G: General or king joins the battlefield
- D: Distribute soldier
- M: General resigns from battle
- P: Prepare for battle
- B: Battle
- U: Cease fire
- T: Trojan horse
- X: Print generals
- Y: Print registration list