• 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

Find the smallest window in a string containing all characters of another string

SAP Hiring Off-Campus General Aptitude

Find the kth number with prime factors 3, 5 and 7

Count Possible Decodings of a given Digit Sequence

Singly linked list

Cisco Hiring Event 21st – 22nd Feb 2015

Adobe Interview Questions 8 month Exp

HackeEarth Flipkart’s Drone

Reliance Jio Software Developer Interview Experience

Sort Stack in place

Fibonacci Hashing & Fastest Hashtable

LeetCode: Binary Tree Maximum Path Sum

Amazon Interview Experience – SDE Chennai

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

Regular Expression Matching

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

Urban Ladder Written Test.

Maximum of all subarrays of size k

Find position of the only set bit

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

Leetcode: Edit Distance

Leetcode: Merge Intervals

Generic Object Oriented Stack with Template

Possible sizes of bus to carry n groups of friends

1014 Practice Question of New GRE – Princeton

Knight Tour Problem (Graph – Breadth First Search)

Find two non repeating elements in an array of repeating elements

Level order traversal in Spiral form

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

Trie Dictionary

Copyright © 2026 · Genesis Framework · WordPress · Log in