In a singly linked list of $$N$$ nodes, the time complexities fo

In a singly linked list of $$N$$ nodes, the time complexities for query and insertion are $$O(1)$$ and $$O(N)$$, respectively. ~@[](1)

答案：FALSE