An implementation and demo of the MaxHeap data structure. Usually heaps are implemented using an array for storage, but I've heard this is bad news for caching. Here's a tree-based implementation. Run It Now!
The program prints numbers 1 - 100, but:
if the number is a multiple of 3, it will print "Fizz"
if the number is a multiple of 5, it will print "Buzz"
if the number is a multiple of both 5 and 3, i
Run It Now!
facebook
twitter
linkedin
blog