C-Programming-data-structure || 2020 MCQ || 1-mark

Last Updated :

Discuss

Comments

What is the worst case time complexity of inserting n elements into an empty linked list, if the linked list needs to be maintained in sorted order?

2020 MCQ || 1-mark

Θ(n log n)

Θ(n²)

Θ(1)

Θ(n)

This question is part of this quiz :

GATE|| C Programming & Data Structure || Pyqs (2010 to 2025 ),GATE || Arrays | Stacks | Queue | Linked list || PYQS (2010 to 2025)

Tags:

Data Structures

Share your thoughts in the comments

author

GeeksforGeeks

Article Tags :

GATE CS