Multiple choice:(neuds) the time complexity of the algorithm for inserting a new node into an ordered single linked list with n nodes to keep the single linked list in order is ().
(neuds) the time complexity of the algorithm for inserting a new node into an ordered single linked list with n nodes to keep the single linked list in order is ()@[ C](2)
A. O(1)
B. $$O(log_{ 2} n)$$
C. O(n)
D. $$O(n^{2})$$
A.O(1)
B.$$O(log_{ 2} n)$$
C.O(n)
D.$$O(n^{2})$$
answer：C
A. O(1)
B. $$O(log_{ 2} n)$$
C. O(n)
D. $$O(n^{2})$$
A.O(1)
B.$$O(log_{ 2} n)$$
C.O(n)
D.$$O(n^{2})$$
answer：C
