An XML file has entries of the type:
<abc> <xyz> Mother </xyz> <pqr> Father </pqr> <lmn> Brothers </lmn> <def> Sisters </def></abc>
In this example, <abc> is a start tag and </abc> is the corresponding end tag, and so on for the others. Your task is to write a recursive function to check whether each start tag has a corresponding end tag in the correct order. Return True if the XML file is valid; otherwise, return False.
The order is important here—the end tag for any tag cannot occur before its corresponding start tag.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.