No.Minimal spanning tree assures that the total weight of the tree is kept at its minimum. But it doesn?t mean that the distance between any two nodes involved in the minimum-spanning tree is minimum.
The time complexity of sequential search is O(n)
Both 2 and 3 are clearly the diadvantages of circular list
Both of them are relation ship constraints
Comments
There are no comments.Copyright ©CuriousTab. All rights reserved.