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

Hash tree is used in data synchronisation. In the worst case the data synchronisation takes ______ time. Correct Answer O(n)

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.

Related Questions