answersLogoWhite

0


Best Answer

A spanning tree is a tree associated with a network. All the nodes of the graph appear on the tree once. A minimum spanning tree is a spanning tree organized so that the total edge weight between nodes is minimized.

User Avatar

Wiki User

12y ago
This answer is:
User Avatar
More answers
User Avatar

Wiki User

12y ago

spanning tree is a tree which is used to find optimum path of a given graph

This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: What is spanning tree in data structure?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Related questions

What is the difference between binary tree and tree data structure?

binary tree is a specific tree data structure where each node can have at most 2 children nodes. In a general Tree data structure nodes can have infinite children nodes.


Can dijkstra's algorithm produce a spanning tree?

yes, but a shortest path tree, not a minimum spanning tree


Difference types of nonlinear data structure?

Tree, Graphs are the types of nonlinear data structure.


What do you call a tree without node in data structure?

A null tree.


What is the best data structure for notepad?

i think it will be tree...


How can you find minimum spanning trees?

with minimum spanning tree algorthim


What does learning mean as it relates to spanning tree protocol?

The switch is receiving BPDUs and populating the MAC address table, but not sending data.


Define tree in data structure?

Tree is directed, cycle-less, connected graph.


What is non linear data strcuture?

A tree is an example for a non-linear data structure.


Does trunking automatically occur when spanning tree protocol is configured on a network?

Spanning Tree Protocol (STP) does not set up trunk links, it is used to remove logical (Layer 2: Data Link) loops in a network in case there is layer 1 (Physical) redundancy


Which data structure represent many to many relationship?

tree


What is the difference between primitive and non primitive data structure?

A primitive data structure is generally a basic structure that is usually built into the language, such as an integer, an array or a linked-list.A non-primitive data structure is built out of primitive data structures linked together in meaningful ways, such as a binary search tree, AVL Tree, Hashtable, etc.