Algorithms For Dummies

 

»

Heaps: A sophisticated tree that allows data insertions into the tree structure. 

The use of data insertion makes sorting faster. You can further classify these 

trees as max heaps and min heaps, depending on the tree’s capability to 

immediately provide the maximum or minimum value present in the tree.

Later  in  the  book,  you  find  algorithms  that  use  balanced  trees,  unbalanced 

trees, and heaps. For instance, Chapter 9 discusses the Dijkstra algorithm and 

 Chapter 14 discusses Huffman encoding. As part of these discussions, the book 

provides pictures and code to explain how each data structure functions and its 

role in making the algorithm work.