Which of the following is TRUE about the efficiency of binary search trees? $($Select all that apply.$)$

Group of answer choices

the insert operation is O$($n$)$ where n is the number of elements being inserted

insert, find, and remove have the same time complexities

they are most efficient when elements are inserted in sorted order

none of these

find is the fastest operation