Topic: Divide And Conquer Problem / Level: advanced

Problem: Use divide and conquer to solve the "Finding the Smallest Common Ancestor" in a binary tree.

Run the code to see the output here...