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.
No comments:
Post a Comment