Programming Homework Help

Kruskal’s algorithm – is a Minimum Spanning Tree algorithm which finds an edge of the least possible weight that connects any two trees in the forest.

Prim’s algorithm – The algorithm operates by building the Minimum Spanning Tree one vertex at a time, from an arbitrary starting vertex, at each step adding the cheapest possible connection from the tree to another vertex.

Binary Tree Traversals

In-order Traversal – Left, Root, Right
Pre-order Traversal – Root, Left, Right
Post-order Traversal – Left, Right, Root