0 votes 0 votes #plz check?? Hradesh patel asked Dec 14, 2016 Hradesh patel 419 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Habibkhan commented Dec 15, 2016 reply Follow Share Wrong answer given..If it is unsorted array which is default assumption then it takes O( E2 ) time to construct MST.. 0 votes 0 votes umang_16 commented Dec 16, 2016 reply Follow Share They have not specified whether the graph is dense or sparse. If the graph is dense then complexity will be O(E.log E). However since there is no option related to that, it can be assumed that the graph is sparse where O(E) = O(V). So, the most appropriate option in this case will be O(V.log V) with disjoint set data structures. So that's why possibly they have chosen Option B. 0 votes 0 votes Please log in or register to add a comment.