{"id":2375,"date":"2020-07-29T07:34:09","date_gmt":"2020-07-29T07:34:09","guid":{"rendered":"https:\/\/blog.prepbytes.com\/?p=2375"},"modified":"2022-03-31T11:44:28","modified_gmt":"2022-03-31T11:44:28","slug":"min-heappaid","status":"publish","type":"post","link":"https:\/\/prepbytes.com\/blog\/min-heappaid\/","title":{"rendered":"Min Heap"},"content":{"rendered":"

\"\"<\/p>\n

CONCEPTS USED:<\/h3>\n
\n

Heaps.<\/p>\n<\/blockquote>\n

DIFFICULTY LEVEL:<\/h3>\n
\n

Easy.<\/p>\n<\/blockquote>\n

PROBLEM STATEMENT(SIMPLIFIED):<\/h3>\n
\n

Given an array containing N integers, your task is to create a min-heap using the elements of the given array and print the heap array. Elements needs to be inserted one by one in the heap.
\nNote: Use heap concepts to solve the problem.<\/p>\n<\/blockquote>\n

<\/strong><\/u><\/a><\/p>\n

For Example :<\/h4>\n
Sample Input\n2\n5\n3 2 4 1 5\n4\n4 2 3 4\n\nSample Output\n1 2 4 3 5 \n2 4 3 4<\/code><\/pre>\n
MIN-HEAP:<\/h3>\n
            15                     13 \n         \/      \\               \/       \\  \n       18        25           20         35 \n      \/                      \/  \\        \/  \\\n    30                     41    51    100   41<\/code><\/pre>\n
\n
A Min-Heap is a complete binary tree in which the value in each internal node is smaller than or equal to the values in the children of that node.
\nMapping the elements of a heap into an array is trivial: if a node is stored a index k, then its left child is stored at index 2k + 1 and its right child at index 2k + 2.<\/p>\n<\/blockquote>\n
How is Min Heap represented?<\/strong><\/p>\n
\n
A Min Heap is a Complete Binary Tree. A Min heap is typically represented as an array. The root element will be at Arr[0]. For any ith node, i.e., Arr[i]:<\/p>\n
Arr[(i -1) \/ 2] returns its parent node.\nArr[(2 * i) + 1] returns its left child node.\nArr[(2 * i) + 2] returns its right child node.<\/code><\/pre>\n<\/blockquote>\n
SOLUTION:<\/h3>\n
\t\t\t\t\t\t