Description: ven a sequence of child-parent pairs, where a pair consists of the child s name followed by the (single) parent s name, and a list of query pairs also expressed as two names, you are to write a program to determine whether the query pairs are related. If the names comprising a query pair are related the program should determine what the relationship is. Consider academic advisees and advisors as exemplars of such a single parent genealogy (we assume a single advisor, i.e., no co-advisors).
To Search:
File list (Check if you may need any files):
Climbing Trees.cpp
input.txt
Download