A subgraph T of a connected, undirected and weighted graph G(V, E) referred as Spanning Tree provided, Subgraph possesses all the vertices of the graph G(V, E) Subgraph

A heap is a tree based data structure that follows, It’s a complete tree , all the levels are completely filled except possibly the last level where all