About this document
Understanding Heap Data Structures by sunnytan4825 is a document available to read on EtoBox.
A heap is a complete binary tree used to implement data structures like priority queues, with two types: Min Heap and Max Heap, defined by the relationship between parent and child nodes. The document also explains the characteristics of priority queues, their types, and introduces graph concepts including directed and undirected graphs, paths, and graph representation methods. Additionally, it covers Dijkstra
- Author
- sunnytan4825
- Language
- EN