MCQOPTIONS
Bookmark
Saved Bookmarks
→
Data Structures and Algorithms
→
Evaluation Infix Expression Not Parenthesized
→
What is the worst case time complexity of inserti...
1.
What is the worst case time complexity of inserting a node in a doubly linked list?
A.
O(nlogn)
B.
O(logn)
C.
O(n)
D.
O(1)
Answer» D. O(1)
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
Consider the following doubly linked list: head-1-2-3-4-5-tail. What will be the list after performing the given sequence of operations?
What is the worst case time complexity of inserting a node in a doubly linked list?
What is a memory efficient double linked list?
WHAT_IS_A_MEMORY_EFFICIENT_DOUBLE_LINKED_LIST??$
Which of the following is false about a doubly linked list?
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply
Your experience on this site will be improved by allowing cookies. Read
Cookie Policy
Reject
Allow cookies