Topic: Divide And Conquer Problem / Level: intermediate

Problem: Implement a divide and conquer solution to find the maximum height of a binary tree given its nodes.

Run the code to see the output here...