Java Program – Find the node with minimum value in a Binary Search Tree – Just traverse the node from root to left recursively until left is NULL.
min tree
2 Articles
2
Prim’s Minimum Spanning Tree – Greedy Algorithm – We have discussed Kruskal’s algorithm for Minimum Spanning Tree. Like Kruskal’s algorithm, Prim’s algorithm is also a Greedy algorithm. It starts with an empty spanning tree the idea is to maintain two sets of vertices.