Data Structure Introduction › Time Complexity › Question #21518
MCQ Single Best Answer Easy

QWhat is the time complexity of the union operation in a disjoint-set data structure with path compression?

ID: #21518 Time Complexity 78 views
Question Info
#21518Q ID
EasyDifficulty
Time ComplexityTopic
Start Quiz on This Topic
 Your Answer

Choose the Best Option

Click any option to instantly check if you're correct.

  • A O(1) ✔ ✖
  • B O(log N) ✔ ✖
  • C O(N) ✔ ✖
  • D O(N log N) ✔ ✖
Correct Answer: Option B

Explanation

The union operation in a disjoint-set with path compression has a time complexity of O(log N), where N is the number of elements.

 Continue Practice
Previous Question Next Question
 Share

Share This Question

Challenge a friend or share with your study group.

 More from This Topic

Related MCQ Questions

What is the time complexity of searching an element in a binary search tree (BST)? What is the time complexity of the selection sort algorithm? What is the time complexity of a linear search in an unsorted array? How is the time complexity of the bubble sort algorithm in the best-case scenario characterized? How is the time complexity of the radix sort algorithm expressed? How is the time complexity of the hash table (worst case) for searching an element characterized? How is the time complexity of the binary heap construction expressed? What is the time complexity of the push operation in a stack data structure? What is the time complexity of the pop operation in a queue data structure? What is the time complexity of the Floyd-Warshall algorithm for all-pairs shortest paths in a weighted graph?