Title: Python - Heaps
Open Graph Title: Python - Heaps
Description: Heap is a special tree structure in which each parent node is less than or equal to its child node. Then it is called a Min Heap. If each parent node is greater than or equal to its child node then it is called a max heap.
Open Graph Description: Heap is a special tree structure in which each parent node is less than or equal to its child node. Then it is called a Min Heap. If each parent node is greater than or equal to its child node then it is called a max heap.
Opengraph URL: https://www.tutorialspoint.com/python_data_structure/python_heaps.htm
Domain: www.tutorialspoint.com
| None | IE=edge |
| og:type | article |
| og:image | https://www.tutorialspoint.com/images/tp_logo_436.png |
Links:
Viewport: viewport-fit=cover, width=device-width, initial-scale=1.0, maximum-scale=3.0, user-scalable=yes