Topic: Divide And Conquer Problem / Level: intermediate

Problem: Implement a divide and conquer approach to find the minimum height of a binary search tree given a set of keys.

Run the code to see the output here...