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.

Graphs

The slides related to graphs can be obtained from here.

Project Details

The project details can be found here.

Tree traversal

There are two types of traversals when we are talking about trees. You can get the notes about both from these links:

Breadth First Traversal

Depth First Traversal

Trees

Before we can study Heap Sort or any of the searching algorithms, we need to understand the concept of trees and how do we go about them.

We start our discussion from binary trees. You can get the linked list implementation of binary trees from here. Keep in mind that all the pointers in this implementation are not deallocated at the end of the program, which causes it to crash sometimes.

In order to see the results, what you can do is to put a break point just before the program finishes so that you can see the results shown by it. If time allows, I will try to fix this problem.

Radix sort

Radix Sort Algorithm

The notes for the course can be obtained here.