{"id":2380,"date":"2020-07-29T07:34:05","date_gmt":"2020-07-29T07:34:05","guid":{"rendered":"https:\/\/blog.prepbytes.com\/?p=2380"},"modified":"2022-03-31T11:38:42","modified_gmt":"2022-03-31T11:38:42","slug":"heap-operations","status":"publish","type":"post","link":"https:\/\/prepbytes.com\/blog\/heap-operations\/","title":{"rendered":"Heap Operations"},"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:<\/p>\n

    \n
  1. To create min-heap(Insert elements one by one).<\/li>\n
  2. Extract the minimum element from the heap created in the first step and print it.<\/li>\n
  3. Print the extracted element and updated heap after extraction, separated by space.
    \nNote: Use heap concepts to solve the problem.<\/li>\n<\/ol>\n<\/blockquote>\n

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

    For Example :<\/h4>\n

    \"\"<\/p>\n

    MIN-HEAP:<\/h3>\n

    \"\"<\/p>\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]:
    \n\"\"<\/p>\n<\/blockquote>\n

    SOLUTION:<\/h3>\n

    \t\t\t\t\t\t