Topic: Divide And Conquer Problem / Level: advanced

Problem: Use divide and conquer to find the "Maximum Depth of a N-ary Tree".

Run the code to see the output here...