What is the time complexity of deleting from the rear end of the dequeue implemented with a singly linked list? Q & A › Category: Data Structure › What is the time complexity of deleting from the rear end of the dequeue implemented with a singly linked list? 0 Vote Up Vote Down Admin Staff asked 4 years ago What is the time complexity of deleting from the rear end of the dequeue implemented with a singly linked list? a) O(nlogn) b) O(logn) c) O(n) d) O(n2) Share this:TwitterFacebookWhatsAppPinterestLike this:Like Loading... 1 Answers 0 Vote Up Vote Down Admin Staff answered 4 years ago c) O(n) Share this:TwitterFacebookWhatsAppPinterestLike this:Like Loading...
Admin