https://github.com/muflehhub/SEP200/tree/main/Workshops/WS07

1. How does the std::map build a database? In a linear format or in a tree format?
Ans:- The database is built by the map in the form of a tree. It uses the balanced binary search tree, where the value of the key is used to insert the new elements. Each node of the binary search tree stores the pairs. Hence the value will be the columns of the database.    
2. How is this format advantageous?
Ans:- This format is...