Question

Hash tree is used in data synchronisation. In the worst case the data synchronisation takes ______ time.

(a) O(logn)

(b) O(n^2)

(c) O(nlogn)

(d) O(n)

My enquiry is from Hash Tables in section Hash Tables of Data Structures & Algorithms I

I had been asked this question by my college professor while I was bunking the class.

Answer 1

The correct answer is (d) O(n)

The best explanation: In average scenarios, the synchronisation takes O(logn) because it is based on the traversal and searching. The worst case occurs when there are no nodes in common, so the synchronisation takes O(n) time.