About the Project and Trees

It is extremely important that both the classes, BEE and BSE, give their project vivas before the end of this week, that is by 15th of Friday. Otherwise your marks will not be added as I will not be around during the exams.

Also, I have not provided any notes for Trees, especially binary trees. You are required to read about them from anywhere you wish but I do recommend your course book. Do not forget to read about them just because the notes are not available on this site

Minimum Spanning Trees

You can get the Dijkstra Algorithm from here. For those who are too lazy to search for the other MST algorithms, can get them from here:

Prim's
Kruskal's
Dijkstra

One IMPORTANT point. I have not given notes for trees anywhere. You are required about them (especially binary trees) from any book or online site. I recommend your course book to do the reading.