Answer:
a) Chess game moves:- Tree data structure is not a good fit.
b) Public transportation paths:- Tree data structure is not a good fit.
c) Relationshi[p among computer files and folders:- Tree data structure is a good fit.
d) Genealogical information:- Tree data structure is a good fit.
e) Parts of books:- Tree data structure is a good fit.
f) Programming language history:- Tree data structure is not a good fit.
g) Mathematical expression:- Tree data structure is a good fit.
Explanation:
a) Chess game moves:- Tree data structure is not a good fit. Since in tree data structure moving backward or sharing the node is not that much easy. Presume, In chess, you have to check any box is empty or not. Here, Graph is the best fit.
b) Public transportation paths:- Tree data structure is not a good fit. whenever shortest path, routes, broadcast come always graph is a good option. Because in the tree you don't know how many time you visit that node
c) Relationshi[p among computer files and folders:- Tree data structure is a good fit. Since they have a predefined route. Go to 'c' drive. Open a particular folder and open a particular file.
d) Genealogical information:- Tree data structure is a good fit. Since genealogical information also has a predefined route. Here, the Graph is not suitable.
e) Parts of books:- Tree data structure is a good fit. Since manages the chapters and topics are not that much complex. You can see any book index which is in a very pretty format.
f) Programming language history:- Tree data structure is not a good fit. To store the history of the programming language we need some unconditional jumps that's why the tree is not suitable.
g) Mathematical expression:- Tree data structure is a good fit. The tree is suitable in some cases. We have an expression tree for postfix, prefix.
