About this document
Max Heap Properties and Operations by Anandi Venougopal is a document available to read on EtoBox.
The document discusses heaps, which are binary trees that satisfy specific properties. A max heap has nodes with values greater than or equal to its children, while a min heap has nodes with values less than its children. Heaps are typically stored as arrays. Operations like insertion and deletion may violate the heap properties and require fixing through percolating nodes up or down. Pseudocode is provided for percolating down and up to restore the heap after operations.
- Author
- Anandi Venougopal
- Language
- EN