Ask your own question, for FREE!
Computer Science 6 Online
OpenStudy (anonymous):

Big O of adding to the back of a doubly-linked list?

OpenStudy (anonymous):

what is it you mean by that question?

OpenStudy (anonymous):

It's O(1) since regardless of the size, you can just get the back element and insert it there.

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!