If $$N$$ numbers are stored in a singly linked list in increasin

If $$N$$ numbers are stored in a singly linked list in increasing order, then the average time complexity for binary search is $$O(logN)$$. ~@[](2)

答案：FALSE