---
title: "Discussion on \"Min Heap Construction\" | Hashnode"
description: "Discussion on \"Min Heap Construction\". Min heap is a binary tree-like structure, which satisfies the following conditions:\n\nEach node value is lesser than the children's.\n\nIt should be a complete tree, if not then the extra children should be added on the left leaf nodes.\n\n\n\nMin heap is i..."
url: "https://hashnode.com/posts/min-heap-construction/645b6c42d243e416d1f1aae7"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [Min Heap Construction](https://blog.arpancodes.io/min-heap-construction?utm_source=hashnode&utm_medium=feed)

Min heap is a binary tree-like structure, which satisfies the following conditions: Each node value is lesser than the children's. It should be a complete tree, if not then the extra children should be added on the left leaf nodes. Min heap is i...

May 10, 2023 · 3 min read · blog.arpancodes.io  
Read the article

-   [#dsa](https://hashnode.com/tag/dsa)
-   [#data-structure-and-algorithms](https://hashnode.com/tag/data-structure-and-algorithms)
-   [#min-heap](https://hashnode.com/tag/min-heap)

## Written by

[Arpan Abhishek](https://hashnode.com/@arpancodes)

@arpancodes

  
[View profile](https://hashnode.com/@arpancodes)

creating experiences on the web!

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
