Binary Search Trees

Given "n" appointments, find the conflicting appointments

Part of the Final 450 DSA sheet. Solve it on one of the links below, then sign up to track your progress.