ASSIGNMENT:5

DATE:10.07.21
1.The running time of the required heap structure is O(nlog(n)) because each call
to heapify costs O(log(n)) and build heap makes O(n).
Heap occurs in a complete binary tree.

Thus the running time of building max-heap is O(n).

2.The best case time complexity of trie is – O(1).
The worst and average case is O(n).
3.The time complexity depends on the edges and vertices of the graph data
structure O(V + |E|)