Tag Archives: data structures

Compare a list priority queue to a heap priority queue in C#

My book Essential Algorithms: A Practical Approach to Computer Algorithms describes lots of other interesting data structures and algorithms, many just as interesting but less complicated than this one. For more information about queues, priority queues, trees and other algorithmic … Continue reading

Posted in algorithms, classes, generic, mathematics, OOP | Tagged , , , , , , , , , , , , | 1 Comment

Make an efficient priority queue class in C#, Part 2

My book Essential Algorithms: A Practical Approach to Computer Algorithms describes lots of other interesting data structures and algorithms, many just as interesting but less complicated than this one. For more information about queues, priority queues, trees and other algorithmic … Continue reading

Posted in algorithms, classes, generic, mathematics, OOP | Tagged , , , , , , , , , , , , | Leave a comment

Make an efficient priority queue class in C#, Part 1

For more information about queues, priority queues, trees and other algorithmic topics, see my book Essential Algorithms: A Practical Approach to Computer Algorithms. A priority queue is a data structure that holds data values with associated priorities. The Enqueue method … Continue reading

Posted in algorithms, classes, generic, mathematics, OOP | Tagged , , , , , , , , , , , , | 1 Comment

Map between nodes and node numbers in a binary tree in C#

For more information about trees and other algorithmic topics, see my book Essential Algorithms: A Practical Approach to Computer Algorithms. Suppose you have a binary tree with the nodes numbered as shown on the right. Note that it may have … Continue reading

Posted in algorithms, drawing, graphics, mathematics | Tagged , , , , , , , , , , , , | 1 Comment