Unlike an array, where any element can be accessed in constant time, reaching the middle element in a linked list is a $\backslash$Theta $($n$)$ operation. Hence, though implementable in principle, binary search would be a horribly inefficient algorithm for searching in a $($sorted$)$ linked list.

Question $16$ options:

True

False