• 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

System Design: Designing a LLD for Hotel Booking

Print vertical sum of all the axis in the given binary tree

Generic Object Oriented Stack with Template

VMWare Openings

Maximum size of square sub matrix with all 1’s in a binary matrix

Binary Tree Isomorphic to each other

SAP Interview Questions

Binary Tree in Java

Skiing on Mountains Matrix

Stock Buy Sell to Maximize Profit

25 horses 5 tracks Find 3 fastest puzzle

SAP Off Campus Hiring_ March 2015 Computer Skills

How Radix sort works

Find shortest distances between every pair of vertices ( Dynamic Programming Floyd Warshall Algorithm)

Daughter’s Age VeryGood Puzzle

Coin Collection Dynamic Programming

Maximum sum contiguous subarray of an Array

Common Ancestor in a Binary Tree or Binary Search Tree

There are N nuts and N bolts, u have to find all the pairs of nuts and bolts in minimum no. of iteration

Length of the longest substring without repeating characters

Find if a binary tree is height balanced ?

Doubly linked list

Word Break Problem

Given a sorted array and a number x, find the pair in array whose sum is closest to x

Python Array String

Find Percentage of Words matching in Two Strings

Implement LRU Cache

Maximum path sum between two leaves

LeetCode: Container With Most Water

BlueStone E-commerce Interview Experience

Copyright © 2026 · Genesis Framework · WordPress · Log in