Skip to content

Home
C
Python
Java
- Core Java
- JDBC
- Servlets
- JSP
- Oracle
HTML
CSS
JavaScript
ES6
React JS
Resume Preparation

Menu

Home
C
Python
Java
- Core Java
- JDBC
- Servlets
- JSP
- Oracle
HTML
CSS
JavaScript
ES6
React JS
Resume Preparation

DS Using C

DS – Introduction
DS – Memory Allocation
DS – Functions in C
DS – Arrays in C
DS – Strings in C
DS – Structures in C
DS – Pointers in C
DS – Dynamic Memory Allocation in C
DS – Stack Data Structure
DS – Stack Operations
DS – Stack Program without Functions
DS – Stack using and Functions
DS – Stack Using Pointers
DS – Stack Program using Pointers
DS – Queue Data Structure
DS – Queue Operations
DS – Queue Program using Arrays
DS – Dynamic Queue
DS – Queue implementation using Pointers
DS – Circular Queue
DS – Circular Queue Program
DS – Circular Queue Program in Other way
DS – Double Ended Queue
DS – Double Ended Queue Program
DS – Linked Lists Introduction
DS – Single Linked List
DS – Single Linked List Program
DS – Swapping Node values in Single Linked List
DS – Stack using Single Linked List
DS – Stack Program using Linked List
DS – Queue using Linked List
DS – Reverse Linked List
DS – Search Element in Linked List
DS – Sort Linked List
DS – Merge 2 Linked Lists
DS – Adjecent Node Swapping in Linked List
DS – Linked List using Recursion
DS – Reverse Linked List using Recursion
DS – Double Linked List
DS – Double Linked List – Insertion – Display
DS – Double Linked List Removal
DS – Reverse Double Linked List
DS – Double Linked List Program
DS – Slow Fast Pointer in C
DS – Circular Linked List
DS – Binary Search Tree
DS – Insert Node into BST
DS – BST Node Deletion
DS – BST Traversal
DS – BST Insertion using Recursion
BST Traversal without Recursion
DS – Expression Evaluation
DS – Infix to Postfix Conversion
DS – Infix to Postfix Program
DS – Infix to Prefix Algorithm
DS – Infix to Prefix Program
DS – Construct Expression Tree from Prefix expression
DS – Code implementation from Prefix to Postfix:
DS – Algorithm to construct Expression tree from Postfix
DS – Code implementation from Postfix to Prefix:
DS – Evaluation of Prefix Expression
DS – Algorithm to evaluate Postfix expression
DS – Introduction to Graphs
DS – Graph Operations
DS – Program to Create Graph
DS – BFS Graph Traversal
DS – DFS Graph Algorithm
DS – AVL Trees
DS – AVL Rotations
DS – AVL Double Rotations
DS – AVL Program
DS – AVL Program Explanation
DS – Perform AVL Tree Operations
DS – Red Black Trees
DS – AVL Tree Operations
DS – Linear Search
DS – Linear search using recursion
DS – Binary Search
DS – Hash Search Algorithm
DS – Hash Search Algorithm – Load Factor
DS – Hash Search Algorithm Program
DS – Sorting Techniques
DS – Bubble Sort Algorithm
DS – Optimized Bubble Sort
DS – Selection Sort
DS – Insertion Sort
DS – Heap Sort Algorithm
DS – Heap Sort Program
DS – Merge Soft Algorithm
DS – Merge Sort Program
DS – Quick Sort Algorithm
DS – Time complexity
DS – Adjacency Matrix
DS – Prim’s Code Program
DS – Dijkstra’s algorithm
DS – Minimum Spanning Tree
DS – Cost of Minimum Spanning Tree
DS – Huffman Coding

DS – Minimum Spanning Tree

Minimum Spanning Tree

It is an application of Graph. It uses Graph data structure.
It is a non linear data structure.
It is an algorithm.

Minimum spanning tree is a tree which is not cyclic.

How many spanning trees possible here:

We can find the spanning trees count depends on number of cycles present in the graph.
One graph can have many cycles.

Post navigation

← Previous Post

Copyright © 2023 Ameerpet Technologies | Powered by Ameerpet Technologies

Scroll to Top