Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing

Kotts

  • 3 years ago

Suppose that you are using the weighted quick-union data structure (without path compression) on a set of N elements. What is the maximum depth of a node? Choose one. 1 log∗⁡N lg⁡N N

  • This Question is Closed
  1. ktobah
    • 3 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    It's LgN, and Lg = base-2 logarithm

  2. Not the answer you are looking for?
    Search for more explanations.

    • Attachments:

Ask your own question

Sign Up
Find more explanations on OpenStudy
Privacy Policy