• 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

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

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

Naurki.com Security Breach

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

Amazon Interview Experience – SDE Chennai

Find an index i such that Arr [i] = i in array of n distinct integers sorted in ascending order.

FizzBuzz Solution C C++

BFS (Breath First Search)

LeetCode: Container With Most Water

Facebook Interview Question : Interleave List

Word Break Problem

C++ OOPs Part2

Linked List V/S Binary Search Tree

Stock Buy Sell to Maximize Profit

Fibonacci Hashing & Fastest Hashtable

SAP Interview Questions

Reliance Jio Software Developer Interview Experience

Knight Tour Problem (Graph – Breadth First Search)

simple sql injection

Max Sum in circularly situated Values

Number of Islands BFS/DFS

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

Mirror of Tree

Client Server C program

Find loop in Singly linked list

VMWare SDEII Interview

Python Array String

Edit Distance ( Dynamic Programming )

Microsoft BING 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

Copyright © 2026 · Genesis Framework · WordPress · Log in