• 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

Sequence Finder Dynamic Programming

Check Binary Tree is Binary Search Tree or not

LeetCode: Binary Tree Maximum Path Sum

Find Nearest Minimum number in left side in O(n)

Regular Expression Matching

Find position of the only set bit

The greedy coins game Dynamic Programming

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

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

Interfaces in C++ (Abstract Classes in C++)

Find the element that appears once others appears thrice

VMWare Openings

Sort Stack in place

Find Percentage of Words matching in Two Strings

Number of Islands BFS/DFS

Trapping Rain Water

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

Templates in C++

CodeChef Code SGARDEN

Count Possible Decodings of a given Digit Sequence

Advanced SQL Injection

Wrong Directions given find minimum moves so that he can reach to the destination

Practo Hiring 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

Diagonal Traversal of Binary Tree

N teams are participating. each team plays twice with all other teams. Some of them will go to the semi final. Find Minimum and Maximum number of matches that a team has to win to qualify for finals ?

Maximum of all subarrays of size k

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

Right view of Binary tree

Naurki.com Security Breach

Copyright © 2026 · Genesis Framework · WordPress · Log in