What is the time complexity for the update cost on auxiliary trees?
Posted: Wed Jul 13, 2022 7:42 pm
a) O (log (log n))
b) k-1 O (log n)
c) K2 O (log n)
d) k+1 O (log (log n))
b) k-1 O (log n)
c) K2 O (log n)
d) k+1 O (log (log n))
Accurate answers. Every time.
https://answerhappy.com/