educative.io

Wouldn't the brute force method only be O(n)? why the binary bst?

Why are we using a bst to check if an interval intersects with another interval?