• Skip to primary navigation
  • Skip to content
  • Skip to primary sidebar
  • Skip to secondary sidebar

GoHired

Interview Questions asked in Google, Microsoft, Amazon

Join WeekEnd Online Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

  • Home
  • Best Java Books
  • Algorithm
  • Internship
  • Certificates
  • About Us
  • Contact Us
  • Privacy Policy
  • Array
  • Stack
  • Queue
  • LinkedList
  • DP
  • Strings
  • Tree
  • Mathametical
  • Puzzles
  • Graph

Spanning Tree

March 1, 2014 by Dhaval Dave

In the mathematical field of graph theory, a spanning tree T of a connected, undirected graph G is a tree that includes all of the vertices and some or all of the edges of G.

Defination

A tree is a connected undirected graph with no cycles. It is a spanning tree of a graph G if it spans G (that is, it includes every vertex of G) and is a subgraph of G (every edge in the tree belongs to G). A spanning tree of a connected graph G can also be defined as a maximal set of edges of G that contains no cycle, or as a minimal set of edges that connect all vertices.

Similar Articles

Filed Under: problem Tagged With: Graph, tree

Reader Interactions

Primary Sidebar

Join WeekEnd Online/Offline Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

Join WeekEnd Online/Offline Batch from 4-April-2020

WhatsApp us

Secondary Sidebar

Custom Search

  • How I cracked AMAZON
  • LeetCode
  • Adobe
  • Amazon
  • Facebook
  • Microsoft
  • Hacker Earth
  • CSE Interview

Top Rated Questions

Print Power Set of a Set

Sequence Finder Dynamic Programming

Find next greater number with same set of digits

Get K Max and Delete K Max in stream of incoming integers

Check Binary Tree is Binary Search Tree or not

Puzzle : 100 doors in a row Visit and Toggle the door. What state the door will be after nth pass ?

LeetCode : Word Search

FizzBuzz Solution C C++

In Given LinkedList Divide LL in N Sub parts and delete first K nodes of each part

Circular Linked List

Microsoft BING Interview Experience

Serialise Deserialise N-ary Tree

Max Sum in circularly situated Values

Walmart Labs Interview Experience

Reliance Jio Software Developer Interview Experience

N Petrol bunks or City arranged in circle. You have Fuel and distance between petrol bunks. Is it possible to find starting point so that we can travel all Petrol Bunks

Code Chef PRGIFT Solution

Binary Tree in Java

How strtok() Works

How Radix sort works

Find if a binary tree is height balanced ?

CodeChef’ RRCOPY

Facebook Interview Question : Interleave List

‘N’ Story Building, with 1,2,3 steps how many ways can a person reach top of building.

Top 10 Interviews Techniqes for Campus Interview in IIT NIT BITS for MTech

write a c program that given a set a of n numbers and another number x determines whether or not there exist two elements in s whose sum is exactly x

Python String and numbers

Inorder and Preorder traversals of a Binary Tree given. Output the Postorder traversal of it.

DFS (Depth First Search)

Common Ancestor in a Binary Tree or Binary Search Tree

Copyright © 2026 · Genesis Framework · WordPress · Log in