retagged by
356 views

1 Answer

1 votes
1 votes

Here, because of adjacency matrix it will take V2 and because of linked list we have to traverse all nodes therefore it  will take V time.

hence O(V3)

Related questions

0 votes
0 votes
1 answer
1
raja11sep asked Jan 15, 2022
835 views
Can anyone explain each option, for every option if it is true then why? If false then why? (Please don’t comment like answer is A,B etc) Please help
0 votes
0 votes
1 answer
2
0 votes
0 votes
3 answers
3
1 votes
1 votes
2 answers
4
Ravi Dubey asked Aug 2, 2018
829 views
Could a binary search tree be built using o(n lg n) comparisons in the comparisonmodel? Explain why or why not.