Does the minimal spanning tree of a graph give the shortest distance between any

Does the minimal spanning tree of a graph give the shortest distance between any 2 specified nodes?

Question Posted / raju kumar

No Answer is Posted For this Question
Be the First to Post Answer

More Data Structures Interview Questions

What is the difference between ienumerable and list?

Is collection a class or interface?

How do you do a heap sort?

Write the procedure to convert general tree to binary tree?

How can you insert a node to the beginning of a singly linked list?

Does array sort mutate?

What is the difference between null and void pointer in data structures?

What is the heap in data structures?

What type of variable is age?

Will hashmap allow null keys?

Write the stack overflow condition.

Construct a doubly linked list using a single pointer in each node?

For more Data Structures Interview Questions Click Here