What is the best case for a perfectly balanced binary search tree?

A ) O(log n) log

B ) O (log² n) ✅

C ) O ( log n)

D ) O n log ( log² n)