I am just posting some information for mostly myself on how to quickly traverse graph and tree data structure since I tend to forget...

Just posting some code on building a min and max heap, I will use an abstract class since both of these classes will contain similar...