{"id":9112,"date":"2025-08-09T00:12:35","date_gmt":"2025-08-08T18:42:35","guid":{"rendered":"https:\/\/namastedev.com\/blog\/?p=9112"},"modified":"2025-10-15T16:42:07","modified_gmt":"2025-10-15T11:12:07","slug":"creating-a-heap","status":"publish","type":"post","link":"https:\/\/namastedev.com\/blog\/creating-a-heap\/","title":{"rendered":"Creating a Heap"},"content":{"rendered":"\n<!-- Creating a Heap: 2 -->\n<!-- Prism.js for Code Highlighting -->\n<link\n    href=\"https:\/\/cdn.jsdelivr.net\/npm\/prismjs@1.29.0\/themes\/prism-tomorrow.min.css\"\n    rel=\"stylesheet\"\n\/>\n<script src=\"https:\/\/cdn.jsdelivr.net\/npm\/prismjs@1.29.0\/prism.min.js\"><\/script>\n<script src=\"https:\/\/cdn.jsdelivr.net\/npm\/prismjs@1.29.0\/plugins\/autoloader\/prism-autoloader.min.js\"><\/script>\n\n<style>\n.wp_blog_theme {\n  --primary: #E58C32;\n  --secondary: #030302;\n  --light-bg: #fef9f4;\n  --text-dark: #2d2d2d;\n  --tab-radius: 12px;\n  --shadow: 0 4px 12px rgba(0, 0, 0, 0.08);\n  --code-bg: #001f3f;\n  --code-text: #d4f1ff;\n}\n\n.wp_blog_container {\n  font-family: 'Segoe UI', sans-serif;\n  background: var(--light-bg);\n  margin: 0;\n  padding: 0;\n  color: var(--text-dark);\n}\n\n\/* Heading *\/\n.wp_blog_main-heading {\n  text-align: center;\n  font-size: 2.4rem;\n  color: var(--primary);\n  margin-top: 2.5rem;\n  font-weight: bold;\n}\n\n\/* Explanation Card *\/\n.wp_blog_explanation,\n.wp_blog_code-tabs-container {\n  max-width: 940px;\n  margin: 2rem auto;\n  padding: 2rem;\n  background: white;\n  border-radius: var(--tab-radius);\n  box-shadow: var(--shadow);\n}\n\n\/* Text and Visuals *\/\n.wp_blog_explanation h2 {\n  font-size: 1.4rem;\n  color: var(--primary);\n  margin-bottom: 0.5rem;\n}\n\n.wp_blog_explanation p,\n.wp_blog_explanation li {\n  font-size: 1.05rem;\n  line-height: 1.7;\n  margin: 0.5rem 0;\n}\n\n.wp_blog_explanation code {\n  background: #fef9f4;   \/* light bg instead of dark blue *\/\n  color: #E58C32;        \/* brand orange *\/\n  padding: 3px 6px;\n  border-radius: 4px;\n  font-family: 'Courier New', monospace;\n  font-weight: 600;      \/* optional, makes it pop *\/\n}\n\n.wp_blog_explanation img {\n  max-width: 100%;\n  border-radius: var(--tab-radius);\n  margin-top: 1rem;\n  box-shadow: 0 2px 12px rgba(0, 0, 0, 0.06);\n}\n\n\/* Tab Buttons *\/\n.wp_blog_code-tabs-header {\n  display: flex;\n  flex-wrap: wrap;\n  gap: 0.5rem;\n  margin-bottom: 1rem;\n}\n\n.wp_blog_code-tab-button {\n  padding: 0.6rem 1.2rem;\n  border: 1px solid var(--primary);\n  background: white;\n  color: var(--primary);\n  border-radius: 50px;\n  font-weight: 600;\n  cursor: pointer;\n  transition: all 0.3s ease;\n}\n\n.wp_blog_code-tab-button:hover {\n  background: var(--secondary);\n}\n\n.wp_blog_code-tab-button.active {\n  background: var(--primary);\n  color: white;\n}\n\n\/* Code Content *\/\n.wp_blog_code-tab-content {\n  display: none;\n  background: var(--code-bg);\n  border-radius: var(--tab-radius);\n}\n\n.wp_blog_code-tab-content.active {\n  display: block;\n}\n\n.wp_blog_code-tab-content pre {\n  margin: 0;\n  padding: 1.5rem;\n  font-size: 1rem;\n  overflow-x: auto;\n  background: var(--code-bg);\n  border-radius: var(--tab-radius);\n  color: var(--code-text);\n}\n\n\/* Dark mode variables *\/\n.wp_blog_theme.dark-mode {\n  --light-bg: #121212;\n  --text-dark: #f5f5f5;\n  --shadow: 0 4px 12px rgba(255, 255, 255, 0.08);\n  --code-bg: #1e1e1e;\n  --code-text: #c5f0ff;\n}\n\n.wp_blog_theme.dark-mode .wp_blog_explanation {\n  background: #1e1e1e;\n}\n\n\/* Dark mode code highlight *\/\n.wp_blog_theme.dark-mode .wp_blog_explanation code {\n  background: #333;\n  color: #ffd27f;\n}\n\n.wp_blog_theme {\n  position: relative; \/* makes it the reference for absolute children *\/\n}\n\n.wp_blog_toggle-btn {\n  position: absolute;\n  top: 1rem;\n  right: 1rem;\n  z-index: 9999;\n  padding: 0.5rem 0.8rem;\n  border-radius: 10%;\n  background: var(--primary);\n  color: white;\n  font-weight: bold;\n  cursor: pointer;\n  border: none;\n  box-shadow: var(--shadow);\n  transition: background 0.3s, transform 0.2s;\n}\n\n.wp_blog_toggle-btn:hover {\n  background: #cc772e;\n}\n\n.wp_blog_theme.dark-mode .wp_blog_code-tabs-container {\n  background: #1e1e1e;\n}\n<\/style>\n\n<div class=\"wp_blog_container wp_blog_theme\">\n          <button id=\"blogNotesThemeToggle\" class=\"wp_blog_toggle-btn\">\ud83c\udf19<\/button>\n    <h1 class=\"wp_blog_main-heading\"><\/h1>\n\n    <div class=\"wp_blog_explanation\">\n        <h2>Array representation of Heap:<\/h2>\n        <ul>\n            <li>We are using <code>array\u2019s<\/code> to represent <code>heap<\/code>.<\/li>\n            <li>We can also represent heap <code>using pointers or references<\/code>.<\/li>\n        <\/ul>\n\n        <h2>MinHeap Representation<\/h2>\n        <ul>\n            <li>Using <code>Level Order traversal<\/code><\/li>\n        <\/ul>\n        <img decoding=\"async\" src=\"https:\/\/namastedev.com\/blog\/wp-content\/uploads\/2025\/08\/Screenshot-2025-08-08-at-7.55.10\u202fPM.png\" alt=\"\">\n        <pre>\n            arr[0] = smallest_Element\n            smallest_Element =  O(1) Time Complexity\n            heap[0] = O(1)\n        <\/pre>\n\n        <h2>Binary Tree representation using Array<\/h2>\n        <i>All the empty spaces are represented by <code>'#'<\/code><\/i>\n        <img decoding=\"async\" src=\"https:\/\/namastedev.com\/blog\/wp-content\/uploads\/2025\/08\/Screenshot-2025-08-09-at-12.10.31\u202fAM.png\" alt=\"\">\n    \n        <h2>MaxHeap Representation<\/h2>\n        <img decoding=\"async\" src=\"https:\/\/namastedev.com\/blog\/wp-content\/uploads\/2025\/08\/Screenshot-2025-08-08-at-8.23.43\u202fPM.png\" alt=\"\">\n        <pre>\n            maxElement = heap[0]\n        <\/pre>\n        <h2>Have to find Children of i<sup>th<\/sup> node:<\/h2>\n        <h3>Formula&#8217;s based on index 1<\/h3>\n        <p><strong><code>left = 2 * i<\/code><\/strong><\/p>\n        <p><strong><code>right = 2 * i + 1<\/code><\/strong><\/p>\n        <p><strong><code>parent = i<sup>th<\/sup><\/code><\/strong><\/p> \n        <img decoding=\"async\" src=\"https:\/\/namastedev.com\/blog\/wp-content\/uploads\/2025\/08\/Screenshot-2025-08-08-at-8.15.23\u202fPM.png\" alt=\"\">\n    \n        <h3>Formula&#8217;s based on index 0<\/h3>\n        <p><strong><code>left = (2*i + 1)<\/code><\/strong><\/p>\n        <p><strong><code>right = (2*i + 2)<\/code><\/strong><\/p>\n        <p><strong><code>parent = (i - 1) \/ 2<\/code><\/strong><\/p>\n\n        <h2>Operations in Heap<\/h2>\n        <ul>\n            <li><strong>Insert<\/strong>\n                <ul>\n                    <li>We need to make sure that we follow these <strong>two rules<\/strong>:\n                        <ul>\n                            <li>Complete Binary Tree<\/li>\n                            <li>Parent value <= children<\/li>\n                        <\/ul>\n                    <\/li>\n                <\/ul>\n            <\/li>\n            <li><strong>Extract \/ Delete<\/strong>\n                <ul>\n                    <li>Only Extract (delete) from the root\/top\/front.<\/li>\n                    <li><code>In minHeap<\/code>: The minimum value will be extracted from the heap.<\/li>\n                    <li><code>In maxHeap<\/code>: The maximum value will be extracted from the heap.<\/li>\n                <\/ul>\n            <\/li>\n            <li><strong>Peek<\/strong>: This also happens at top.<\/li>\n        <\/ul>\n\n        <h2>Inserting Elements to a Heap<\/h2>\n        <h3>MinHeap:<\/h3>\n        <p><strong><code>Insert 1.<\/code><\/strong><\/p>\n        <img decoding=\"async\" src=\"https:\/\/namastedev.com\/blog\/wp-content\/uploads\/2025\/08\/Screenshot-2025-08-08-at-11.41.22\u202fPM.png\" alt=\"\">\n        <ul>\n            <li>Always ensure that your heap is a <code>complete binary tree<\/code>.<\/li>\n            <li>All Parent <= Children<\/li>\n        <\/ul>\n        <img decoding=\"async\" src=\"https:\/\/namastedev.com\/blog\/wp-content\/uploads\/2025\/08\/Screenshot-2025-08-08-at-11.59.52\u202fPM.png\" alt=\"\">\n        <h2>Heapify<\/h3>\n        <p>The process of moving these values up and mainting the property of <code>heap<\/code> is known as <strong>Heapify.<\/strong> \n        Basically, <code>restructuring or rearranging<\/code> the <strong>elements<\/strong> inside the binary tree so that it becomes a <code>Heap<\/code>.\n    <\/p>\n        <p>Above is the example of <code>Heapify-up<\/code><\/p>\n    <\/div>\n<\/div>\n\n<script>\ndocument.addEventListener(\"DOMContentLoaded\", () => {\n  const buttons = document.querySelectorAll(\".wp_blog_code-tab-button\");\n  const contents = document.querySelectorAll(\".wp_blog_code-tab-content\");\n\n  buttons.forEach((button) => {\n    button.addEventListener(\"click\", () => {\n      const lang = button.getAttribute(\"data-lang\");\n\n      buttons.forEach((btn) => btn.classList.remove(\"active\"));\n      contents.forEach((content) => content.classList.remove(\"active\"));\n\n      button.classList.add(\"active\");\n      document\n        .querySelector(`.wp_blog_code-tab-content[data-lang=\"${lang}\"]`)\n        .classList.add(\"active\");\n    });\n  });\n\n  const themeToggle = document.getElementById(\"blogNotesThemeToggle\");\n  const themeContainer = document.querySelector(\".wp_blog_theme\");\n\n  themeToggle.addEventListener(\"click\", () => {\n    themeContainer.classList.toggle(\"dark-mode\");\n    themeToggle.textContent =\n      themeContainer.classList.contains(\"dark-mode\") ? \"\u2600\ufe0f\" : \"\ud83c\udf19\";\n  });\n});\n<\/script>\n","protected":false},"excerpt":{"rendered":"<p>\ud83c\udf19 Array representation of Heap: We are using array\u2019s to represent heap. We can also represent heap using pointers or references. MinHeap Representation Using Level Order traversal arr[0] = smallest_Element smallest_Element = O(1) Time Complexity heap[0] = O(1) Binary Tree representation using Array All the empty spaces are represented by &#8216;#&#8217; MaxHeap Representation maxElement =<\/p>\n","protected":false},"author":108,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"om_disable_all_campaigns":false,"_monsterinsights_skip_tracking":false,"_monsterinsights_sitenote_active":false,"_monsterinsights_sitenote_note":"","_monsterinsights_sitenote_category":0,"footnotes":""},"categories":[322,176,175,211,810,174,172,173],"tags":[],"class_list":["post-9112","post","type-post","status-publish","format-standard","category-algorithms-and-data-structures","category-csharp","category-cplusplus","category-data-structures","category-dsa","category-java","category-javascript","category-python"],"aioseo_notices":[],"_links":{"self":[{"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/posts\/9112","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/users\/108"}],"replies":[{"embeddable":true,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/comments?post=9112"}],"version-history":[{"count":3,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/posts\/9112\/revisions"}],"predecessor-version":[{"id":10335,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/posts\/9112\/revisions\/10335"}],"wp:attachment":[{"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/media?parent=9112"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/categories?post=9112"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/tags?post=9112"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}