{"id":8552,"date":"2022-06-21T09:26:30","date_gmt":"2022-06-21T09:26:30","guid":{"rendered":"https:\/\/www.prepbytes.com\/blog\/?p=8552"},"modified":"2022-12-14T07:41:02","modified_gmt":"2022-12-14T07:41:02","slug":"convert-bst-to-min-heap","status":"publish","type":"post","link":"https:\/\/prepbytes.com\/blog\/convert-bst-to-min-heap\/","title":{"rendered":"Convert BST to Min Heap"},"content":{"rendered":"<p><img decoding=\"async\" src=\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1655802414777-Convert%20BST%20to%20Min%20Heap.jpg\" alt=\"\" \/><\/p>\n<h3>Problem Statement:<\/h3>\n<p>In this problem, we will be given a binary search tree and we have to convert the Binary search tree into a min-heap. This condition is applied to all the nodes in the converted Min Heap. <\/p>\n<\/p>\n<h3>What is Min-Heap?<\/h3>\n<p>Min &#8211; Heap follows the property of a complete binary tree in which the value of the internal node is smaller than or equal to the value of the children of that node.<br \/>\nIn 0 &#8211; based indexing, the node stored at k index in the array will have its left child held at index 2k + 1 and its right child at index 2k + 2.<\/p>\n<p><img decoding=\"async\" src=\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1656506243133-Image%202-03.png\" alt=\"\" \/><\/p>\n<h3>What is BST?<\/h3>\n<p>Binary Search Tree is a type of binary tree which satisfies the following properties:<\/p>\n<ul>\n<li>The left subtree of any node contains only nodes with value smaller than the parent\u2019s node value.<\/li>\n<li>The right subtree of any node contains only nodes with values bigger than the parent\u2019s node value.<\/li>\n<li>The left and right subtree each must be a BST.<\/li>\n<\/ul>\n<p><img decoding=\"async\" src=\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1656506176141-Image-02%20%282%29.png\" alt=\"\" \/><\/p>\n<p><strong><em>Let\u2019s take an examplefor understanding the problem statement:<\/em><\/strong><\/p>\n<p><img decoding=\"async\" src=\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1655802485351-Image%202-02.png\" alt=\"\" \/><\/p>\n<p>In this example, all the given conditions are satisfied i.e. the value in the left subtree of a root node should be less than the values of the right subtree of the root node.<\/p>\n<\/p>\n<h3>Algorithm:<\/h3>\n<ul>\n<li>Create an array of size n, where n is the number of nodes in the given BST.<\/li>\n<li>Perform the inorder traversal of the BST  and copy the values of the nodes in the array.<\/li>\n<li>Now Perform the preorder traversal of the BST.<\/li>\n<li>While traversing the BST in a preorder manner, copy the values one by one from the array to the nodes.<\/li>\n<\/ul>\n<h3>Dry Run:<\/h3>\n<p><img decoding=\"async\" src=\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1655802578095-Image%202-01.png\" alt=\"\" \/><\/p>\n<h4>Code Implementation<\/h4>\n\t\t\t\t\t\t<style>\r\n\t\t\t\t\r\n\t\t\t\t\t#tab_container_8554 {\r\n\toverflow:hidden;\r\n\tdisplay:block;\r\n\twidth:100%;\r\n\tborder:0px solid #ddd;\r\n\tmargin-bottom:30px;\r\n\t}\r\n\r\n#tab_container_8554 .tab-content{\r\n\tpadding:20px;\r\n\tborder: 1px solid #e6e6e6 !important;\r\n\tmargin-top: 0px;\r\n\tbackground-color:#ffffff !important;\r\n\tcolor: #000000 !important;\r\n\tfont-size:16px !important;\r\n\tfont-family: Open Sans !important;\r\n\t\r\n\t\tborder: 1px solid #e6e6e6 !important;\r\n\t}\r\n#tab_container_8554 .wpsm_nav-tabs {\r\n    border-bottom: 0px solid #ddd;\r\n}\r\n#tab_container_8554 .wpsm_nav-tabs > li.active > a, #tab_container_8554 .wpsm_nav-tabs > li.active > a:hover, #tab_container_8554 .wpsm_nav-tabs > li.active > a:focus {\r\n\tcolor: #000000 !important;\r\n\tcursor: default;\r\n\tbackground-color: #ffffff !important;\r\n\tborder: 1px solid #e6e6e6 !important;\r\n}\r\n\r\n#tab_container_8554 .wpsm_nav-tabs > li > a {\r\n    margin-right: 0px !important; \r\n    line-height: 1.42857143 !important;\r\n    border: 1px solid #d5d5d5 !important;\r\n    border-radius: 0px 0px 0 0 !important; \r\n\tbackground-color: #e8e8e8 !important;\r\n\tcolor: #000000 !important;\r\n\tpadding: 15px 18px 15px 18px !important;\r\n\ttext-decoration: none !important;\r\n\tfont-size: 14px !important;\r\n\ttext-align:center !important;\r\n\tfont-family: Open Sans !important;\r\n}\r\n#tab_container_8554 .wpsm_nav-tabs > li > a:focus {\r\noutline: 0px !important;\r\n}\r\n\r\n#tab_container_8554 .wpsm_nav-tabs > li > a:before {\r\n\tdisplay:none !important;\r\n}\r\n#tab_container_8554 .wpsm_nav-tabs > li > a:after {\r\n\tdisplay:none !important ;\r\n}\r\n#tab_container_8554 .wpsm_nav-tabs > li{\r\npadding:0px !important ;\r\nmargin:0px;\r\n}\r\n\r\n#tab_container_8554 .wpsm_nav-tabs > li > a:hover , #tab_container_8554 .wpsm_nav-tabs > li > a:focus {\r\n    color: #000000 !important;\r\n    background-color: #e8e8e8 !important;\r\n\tborder: 1px solid #d5d5d5 !important;\r\n\t\r\n}\r\n#tab_container_8554 .wpsm_nav-tabs > li > a .fa{\r\n\r\nmargin-right:5px !important;\r\n\r\nmargin-left:5px !important;\r\n\r\n\r\n}\r\n\r\n\t\t#tab_container_8554 .wpsm_nav-tabs a{\r\n\t\t\tbackground-image: none;\r\n\t\t\tbackground-position: 0 0;\r\n\t\t\tbackground-repeat: repeat-x;\r\n\t\t}\r\n\t\t\t\r\n\r\n\r\n#tab_container_8554 .wpsm_nav-tabs > li {\r\n    float: left;\r\n    margin-bottom: -1px !important;\r\n\tmargin-right:0px !important; \r\n}\r\n\r\n\r\n#tab_container_8554 .tab-content{\r\noverflow:hidden !important;\r\n}\r\n\r\n\r\n@media (min-width: 769px) {\r\n\r\n\t#tab_container_8554 .wpsm_nav-tabs > li{\r\n\t\tfloat:left !important ;\r\n\t\t\t\tmargin-right:-1px !important;\r\n\t\t\t\t\t}\r\n\t#tab_container_8554 .wpsm_nav-tabs{\r\n\t\tfloat:none !important;\r\n\t\tmargin:0px !important;\r\n\t}\r\n\r\n\t#tab_container_8554 .wpsm_nav-tabs > li {\r\n\t\t\t\t\r\n\t}\r\n\t#tab_container_8554 .wpsm_nav{\r\n\t\t\t}\r\n\r\n}\r\n\r\n\r\n\r\n@media (max-width: 768px) {\r\n\t#tab_container_8554 .wpsm_nav-tabs > li {\r\n\t\t\t\t\r\n\t}\r\n\t#tab_container_8554 .wpsm_nav{\r\n\t\t\t}\r\n}\r\n\r\n\r\n\t.wpsm_nav-tabs li:before{\r\n\t\tdisplay:none !important;\r\n\t}\r\n\r\n\t@media (max-width: 768px) {\r\n\t\t\t\t\r\n\t\t\t\t.wpsm_nav-tabs{\r\n\t\t\tmargin-left:0px !important;\r\n\t\t\tmargin-right:0px !important; \r\n\t\t\t\r\n\t\t}\r\n\t\t\t\t#tab_container_8554 .wpsm_nav-tabs > li{\r\n\t\t\tfloat:none !important;\r\n\t\t}\r\n\t\t\t\r\n\t}\t\t\t\t<\/style>\r\n\t\t\t\t<div id=\"tab_container_8554\" >\r\n\t \r\n\t\t\t\t\t<ul class=\"wpsm_nav wpsm_nav-tabs\" role=\"tablist\" id=\"myTab_8554\">\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t<li role=\"presentation\"  class=\"active\"  onclick=\"do_resize()\">\r\n\t\t\t\t\t\t\t\t<a href=\"#tabs_desc_8554_1\" aria-controls=\"tabs_desc_8554_1\" role=\"tab\" data-toggle=\"tab\">\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<i class=\"fa fa-code\"><\/i> \t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t<span>C++<\/span>\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t<\/a>\r\n\t\t\t\t\t\t\t<\/li>\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t<li role=\"presentation\"  onclick=\"do_resize()\">\r\n\t\t\t\t\t\t\t\t<a href=\"#tabs_desc_8554_2\" aria-controls=\"tabs_desc_8554_2\" role=\"tab\" data-toggle=\"tab\">\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<i class=\"fa fa-code\"><\/i> \t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t<span>Java<\/span>\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t<\/a>\r\n\t\t\t\t\t\t\t<\/li>\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t<li role=\"presentation\"  onclick=\"do_resize()\">\r\n\t\t\t\t\t\t\t\t<a href=\"#tabs_desc_8554_3\" aria-controls=\"tabs_desc_8554_3\" role=\"tab\" data-toggle=\"tab\">\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<i class=\"fa fa-code\"><\/i> \t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t<span>Python<\/span>\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t<\/a>\r\n\t\t\t\t\t\t\t<\/li>\r\n\t\t\t\t\t\t\t\t\t\t\t <\/ul>\r\n\r\n\t\t\t\t\t  <!-- Tab panes -->\r\n\t\t\t\t\t  <div class=\"tab-content\" id=\"tab-content_8554\">\r\n\t\t\t\t\t\t\t\t\t\t\t\t <div role=\"tabpanel\" class=\"tab-pane  in active \" id=\"tabs_desc_8554_1\">\r\n\t\t\t\t\t\t\t\t<!-- wp:enlighter\/codeblock {\"language\":\"cpp\"} -->\r\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"cpp\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">\r\n#include &lt;bits\/stdc++.h&gt;\r\nusing namespace std;\r\n \r\nstruct Node {\r\n    int data;\r\n    Node *left, *right;\r\n};\r\n \r\nstruct Node* getNode(int data)\r\n{\r\n    struct Node* newNode = new Node;\r\n    newNode-&gt;data = data;\r\n    newNode-&gt;left = newNode-&gt;right = NULL;\r\n    return newNode;\r\n}\r\n \r\nvoid preorderTraversal(Node*);\r\n \r\nvoid inorderTraversal(Node* root, vector&lt;int&gt;&amp; arr)\r\n{\r\n    if (root == NULL)\r\n        return;\r\n \r\n    inorderTraversal(root-&gt;left, arr);\r\n \r\n    arr.push_back(root-&gt;data);\r\n \r\n    inorderTraversal(root-&gt;right, arr);\r\n}\r\n \r\nvoid BSTToMinHeap(Node* root, vector&lt;int&gt; arr, int* i)\r\n{\r\n    if (root == NULL)\r\n        return;\r\n \r\n    root-&gt;data = arr[++*i];\r\n \r\n    BSTToMinHeap(root-&gt;left, arr, i);\r\n \r\n    BSTToMinHeap(root-&gt;right, arr, i);\r\n}\r\n \r\nvoid convertToMinHeapUtil(Node* root)\r\n{\r\n    vector&lt;int&gt; arr;\r\n    int i = -1;\r\n \r\n    inorderTraversal(root, arr);\r\n \r\n    BSTToMinHeap(root, arr, &amp;i);\r\n}\r\n \r\nvoid preorderTraversal(Node* root)\r\n{\r\n    if (!root)\r\n        return;\r\n    cout &lt;&lt; root-&gt;data &lt;&lt; &quot; &quot;;\r\n \r\n    preorderTraversal(root-&gt;left);\r\n \r\n    preorderTraversal(root-&gt;right);\r\n}\r\n \r\nint main()\r\n{\r\n    \/\/ BST formation\r\n    struct Node* root = getNode(4);\r\n    root-&gt;left = getNode(2);\r\n    root-&gt;right = getNode(6);\r\n    root-&gt;left-&gt;left = getNode(1);\r\n    root-&gt;left-&gt;right = getNode(3);\r\n    root-&gt;right-&gt;left = getNode(5);\r\n    root-&gt;right-&gt;right = getNode(7);\r\n \r\n    convertToMinHeapUtil(root);\r\n    cout &lt;&lt; &quot;Preorder Traversal:&quot; &lt;&lt; endl;\r\n    preorderTraversal(root);\r\n \r\n    return 0;\r\n}\r\n<\/pre>\r\n<!-- \/wp:enlighter\/codeblock -->\r\n\t\t\t\t\t\t <\/div>\r\n\t\t\t\t\t\t\t\t\t\t\t\t <div role=\"tabpanel\" class=\"tab-pane \" id=\"tabs_desc_8554_2\">\r\n\t\t\t\t\t\t\t\t<!-- wp:enlighter\/codeblock {\"language\":\"java\"} -->\r\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"java\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">\r\nimport java.util.ArrayList;\r\n \r\nclass PrepBytes {\r\n \r\n    static class Node {\r\n \r\n        int data;\r\n        Node left, right;\r\n \r\n        Node()\r\n        {\r\n            this.data = 0;\r\n            this.left = this.right = null;\r\n        }\r\n \r\n        Node(int data)\r\n        {\r\n            this.data = data;\r\n            this.left = this.right = null;\r\n        }\r\n    }\r\n \r\n    private static void preOrder(Node root)\r\n    {\r\n        if (root == null)\r\n            return;\r\n        System.out.print(root.data + &quot; &quot;);\r\n        preOrder(root.left);\r\n        preOrder(root.right);\r\n    }\r\n \r\n    private static void bstToArray(Node root,\r\n                                   ArrayList&lt;Integer&gt; arr)\r\n    {\r\n        if (root == null)\r\n            return;\r\n \r\n        bstToArray(root.left, arr);\r\n \r\n        arr.add(root.data);\r\n \r\n        bstToArray(root.right, arr);\r\n    }\r\n     \r\n    static int index;\r\n    private static void arrToMinHeap(Node root,\r\n                                     ArrayList&lt;Integer&gt; arr)\r\n    {\r\n        if (root == null)\r\n            return;\r\n        root.data = arr.get(index++);\r\n \r\n        arrToMinHeap(root.left, arr);\r\n        arrToMinHeap(root.right, arr);\r\n    }\r\n    static void convertToMinHeap(Node root)\r\n    {\r\n          index = 0;\r\n        ArrayList&lt;Integer&gt; arr = new ArrayList&lt;Integer&gt;();\r\n        bstToArray(root, arr);\r\n \r\n        arrToMinHeap(root, arr);\r\n    }\r\n \r\n    public static void main(String[] args)\r\n    {\r\n \r\n        Node root = new Node(4);\r\n        root.left = new Node(2);\r\n        root.right = new Node(6);\r\n        root.left.left = new Node(1);\r\n        root.left.right = new Node(3);\r\n        root.right.left = new Node(5);\r\n        root.right.right = new Node(7);\r\n \r\n        System.out.print(\r\n            &quot;Preorder Traversal Before Conversion :&quot;\r\n            + &quot;&#92;n&quot;);\r\n        preOrder(root);\r\n        convertToMinHeap(root);\r\n \r\n        System.out.print(\r\n            &quot;&#92;nPreorder Traversal After Conversion :&quot;\r\n            + &quot;&#92;n&quot;);\r\n        preOrder(root);\r\n    }\r\n}\r\n<\/pre>\r\n<!-- \/wp:enlighter\/codeblock -->\r\n\t\t\t\t\t\t <\/div>\r\n\t\t\t\t\t\t\t\t\t\t\t\t <div role=\"tabpanel\" class=\"tab-pane \" id=\"tabs_desc_8554_3\">\r\n\t\t\t\t\t\t\t\t<!-- wp:enlighter\/codeblock {\"language\":\"Python\"} -->\r\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"Python\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">\r\nclass Node:\r\n \r\n    def __init__(self, data):\r\n        self.data = data\r\n        self.left = None\r\n        self.right = None\r\n \r\n \r\ndef inorderTraversal(root, arr):\r\n    if root == None:\r\n        return\r\n \r\n    inorderTraversal(root.left, arr)\r\n \r\n    arr.append(root.data)\r\n \r\n    inorderTraversal(root.right, arr)\r\n \r\n \r\ndef BSTToMinHeap(root, arr, i):\r\n    if root == None:\r\n        return\r\n \r\n    i[0] += 1\r\n    root.data = arr[i[0]]\r\n \r\n    BSTToMinHeap(root.left, arr, i)\r\n \r\n    BSTToMinHeap(root.right, arr, i)\r\n \r\n \r\ndef convertToMinHeapUtil(root):\r\n \r\n    arr = []\r\n    i = [-1]\r\n \r\n    inorderTraversal(root, arr)\r\n \r\n    BSTToMinHeap(root, arr, i)\r\n \r\n \r\ndef preorderTraversal(root):\r\n    if root == None:\r\n        return\r\n \r\n    print(root.data, end=&quot; &quot;)\r\n \r\n    preorderTraversal(root.left)\r\n \r\n    preorderTraversal(root.right)\r\n \r\n \r\nif __name__ == '__main__':\r\n \r\n    root = Node(4)\r\n    root.left = Node(2)\r\n    root.right = Node(6)\r\n    root.left.left = Node(1)\r\n    root.left.right = Node(3)\r\n    root.right.left = Node(5)\r\n    root.right.right = Node(7)\r\n \r\n    convertToMinHeapUtil(root)\r\n    print(&quot;Preorder Traversal:&quot;)\r\n    preorderTraversal(root)\r\n<\/pre>\r\n<!-- \/wp:enlighter\/codeblock -->\r\n\t\t\t\t\t\t <\/div>\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t <\/div>\r\n\t\t\t\t\t \r\n\t\t\t\t <\/div>\r\n <script>\r\n\t\tjQuery(function () {\r\n\t\t\tjQuery('#myTab_8554 a:first').tab('show')\r\n\t\t});\r\n\t\t\r\n\t\t\t\tjQuery(function(){\r\n\t\t\tvar b=\"fadeIn\";\r\n\t\t\tvar c;\r\n\t\t\tvar a;\r\n\t\t\td(jQuery(\"#myTab_8554 a\"),jQuery(\"#tab-content_8554\"));function d(e,f,g){\r\n\t\t\t\te.click(function(i){\r\n\t\t\t\t\ti.preventDefault();\r\n\t\t\t\t\tjQuery(this).tab(\"show\");\r\n\t\t\t\t\tvar h=jQuery(this).data(\"easein\");\r\n\t\t\t\t\tif(c){c.removeClass(a);}\r\n\t\t\t\t\tif(h){f.find(\"div.active\").addClass(\"animated \"+h);a=h;}\r\n\t\t\t\t\telse{if(g){f.find(\"div.active\").addClass(\"animated \"+g);a=g;}else{f.find(\"div.active\").addClass(\"animated \"+b);a=b;}}c=f.find(\"div.active\");\r\n\t\t\t\t});\r\n\t\t\t}\r\n\t\t});\r\n\t\t\r\n\r\n\t\tfunction do_resize(){\r\n\r\n\t\t\tvar width=jQuery( '.tab-content .tab-pane iframe' ).width();\r\n\t\t\tvar height=jQuery( '.tab-content .tab-pane iframe' ).height();\r\n\r\n\t\t\tvar toggleSize = true;\r\n\t\t\tjQuery('iframe').animate({\r\n\t\t\t    width: toggleSize ? width : 640,\r\n\t\t\t    height: toggleSize ? height : 360\r\n\t\t\t  }, 250);\r\n\r\n\t\t\t  toggleSize = !toggleSize;\r\n\t\t}\r\n\r\n\r\n\t<\/script>\r\n\t\t\t\t\r\n\t\t\t\n<p><strong>Time Complexity:<\/strong> O(N)<br \/>\n<strong>Space Complexity:<\/strong> O(N)<\/p>\n<p>This article tried to discuss <strong>How to Convert BST to Min Heap<\/strong>. Hope this blog helps you understand the implementation. To practice more problems you can check out <a href=\"#\"><\/a> at <a href=\"https:\/\/www.prepbytes.com\/\"> Prepbytes<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Problem Statement: In this problem, we will be given a binary search tree and we have to convert the Binary search tree into a min-heap. This condition is applied to all the nodes in the converted Min Heap. What is Min-Heap? Min &#8211; Heap follows the property of a complete binary tree in which the [&hellip;]<\/p>\n","protected":false},"author":52,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_monsterinsights_skip_tracking":false,"_monsterinsights_sitenote_active":false,"_monsterinsights_sitenote_note":"","_monsterinsights_sitenote_category":0,"footnotes":""},"categories":[153],"tags":[177,175,179],"class_list":["post-8552","post","type-post","status-publish","format-standard","hentry","category-tree","tag-binary-search-tree","tag-heap","tag-tree"],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v25.8 - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>Convert BST to Min Heap | Heap | Prepbytes<\/title>\n<meta name=\"description\" content=\"BST (binary Search tree) is a data structure that supports insertion, deletion, and searching operations efficiently. In this article you will learn how to convert BST to min heap.\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/prepbytes.com\/blog\/convert-bst-to-min-heap\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Convert BST to Min Heap | Heap | Prepbytes\" \/>\n<meta property=\"og:description\" content=\"BST (binary Search tree) is a data structure that supports insertion, deletion, and searching operations efficiently. In this article you will learn how to convert BST to min heap.\" \/>\n<meta property=\"og:url\" content=\"https:\/\/prepbytes.com\/blog\/convert-bst-to-min-heap\/\" \/>\n<meta property=\"og:site_name\" content=\"PrepBytes Blog\" \/>\n<meta property=\"article:publisher\" content=\"https:\/\/www.facebook.com\/prepbytes0211\/\" \/>\n<meta property=\"article:published_time\" content=\"2022-06-21T09:26:30+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2022-12-14T07:41:02+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1655802414777-Convert%20BST%20to%20Min%20Heap.jpg\" \/>\n<meta name=\"author\" content=\"Prepbytes\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"Prepbytes\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"2 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/prepbytes.com\/blog\/convert-bst-to-min-heap\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/convert-bst-to-min-heap\/\"},\"author\":{\"name\":\"Prepbytes\",\"@id\":\"http:\/\/43.205.93.38\/#\/schema\/person\/3f7dc4ae851791d5947a7f99df363d5e\"},\"headline\":\"Convert BST to Min Heap\",\"datePublished\":\"2022-06-21T09:26:30+00:00\",\"dateModified\":\"2022-12-14T07:41:02+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/convert-bst-to-min-heap\/\"},\"wordCount\":323,\"commentCount\":0,\"publisher\":{\"@id\":\"http:\/\/43.205.93.38\/#organization\"},\"image\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/convert-bst-to-min-heap\/#primaryimage\"},\"thumbnailUrl\":\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1655802414777-Convert%20BST%20to%20Min%20Heap.jpg\",\"keywords\":[\"binary search tree\",\"heap\",\"tree\"],\"articleSection\":[\"Trees\"],\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"https:\/\/prepbytes.com\/blog\/convert-bst-to-min-heap\/#respond\"]}]},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/prepbytes.com\/blog\/convert-bst-to-min-heap\/\",\"url\":\"https:\/\/prepbytes.com\/blog\/convert-bst-to-min-heap\/\",\"name\":\"Convert BST to Min Heap | Heap | Prepbytes\",\"isPartOf\":{\"@id\":\"http:\/\/43.205.93.38\/#website\"},\"primaryImageOfPage\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/convert-bst-to-min-heap\/#primaryimage\"},\"image\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/convert-bst-to-min-heap\/#primaryimage\"},\"thumbnailUrl\":\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1655802414777-Convert%20BST%20to%20Min%20Heap.jpg\",\"datePublished\":\"2022-06-21T09:26:30+00:00\",\"dateModified\":\"2022-12-14T07:41:02+00:00\",\"description\":\"BST (binary Search tree) is a data structure that supports insertion, deletion, and searching operations efficiently. In this article you will learn how to convert BST to min heap.\",\"breadcrumb\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/convert-bst-to-min-heap\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/prepbytes.com\/blog\/convert-bst-to-min-heap\/\"]}]},{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/prepbytes.com\/blog\/convert-bst-to-min-heap\/#primaryimage\",\"url\":\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1655802414777-Convert%20BST%20to%20Min%20Heap.jpg\",\"contentUrl\":\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1655802414777-Convert%20BST%20to%20Min%20Heap.jpg\"},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/prepbytes.com\/blog\/convert-bst-to-min-heap\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"http:\/\/43.205.93.38\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Trees\",\"item\":\"https:\/\/prepbytes.com\/blog\/category\/tree\/\"},{\"@type\":\"ListItem\",\"position\":3,\"name\":\"Convert BST to Min Heap\"}]},{\"@type\":\"WebSite\",\"@id\":\"http:\/\/43.205.93.38\/#website\",\"url\":\"http:\/\/43.205.93.38\/\",\"name\":\"PrepBytes Blog\",\"description\":\"ONE-STOP RESOURCE FOR EVERYTHING RELATED TO CODING\",\"publisher\":{\"@id\":\"http:\/\/43.205.93.38\/#organization\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"http:\/\/43.205.93.38\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"en-US\"},{\"@type\":\"Organization\",\"@id\":\"http:\/\/43.205.93.38\/#organization\",\"name\":\"Prepbytes\",\"url\":\"http:\/\/43.205.93.38\/\",\"logo\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"http:\/\/43.205.93.38\/#\/schema\/logo\/image\/\",\"url\":\"https:\/\/blog.prepbytes.com\/wp-content\/uploads\/2025\/07\/uzxxllgloialmn9mhwfe.webp\",\"contentUrl\":\"https:\/\/blog.prepbytes.com\/wp-content\/uploads\/2025\/07\/uzxxllgloialmn9mhwfe.webp\",\"width\":160,\"height\":160,\"caption\":\"Prepbytes\"},\"image\":{\"@id\":\"http:\/\/43.205.93.38\/#\/schema\/logo\/image\/\"},\"sameAs\":[\"https:\/\/www.facebook.com\/prepbytes0211\/\",\"https:\/\/www.instagram.com\/prepbytes\/\",\"https:\/\/www.linkedin.com\/company\/prepbytes\/\",\"https:\/\/www.youtube.com\/channel\/UC0xGnHDrjUM1pDEK2Ka5imA\"]},{\"@type\":\"Person\",\"@id\":\"http:\/\/43.205.93.38\/#\/schema\/person\/3f7dc4ae851791d5947a7f99df363d5e\",\"name\":\"Prepbytes\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"http:\/\/43.205.93.38\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/secure.gravatar.com\/avatar\/232042cd1a1ea0e982c96d2a2ec93fb70a8e864e00784491231e7bfe5a9e06b5?s=96&d=mm&r=g\",\"contentUrl\":\"https:\/\/secure.gravatar.com\/avatar\/232042cd1a1ea0e982c96d2a2ec93fb70a8e864e00784491231e7bfe5a9e06b5?s=96&d=mm&r=g\",\"caption\":\"Prepbytes\"},\"url\":\"https:\/\/prepbytes.com\/blog\/author\/gourav-jaincollegedekho-com\/\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Convert BST to Min Heap | Heap | Prepbytes","description":"BST (binary Search tree) is a data structure that supports insertion, deletion, and searching operations efficiently. In this article you will learn how to convert BST to min heap.","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/prepbytes.com\/blog\/convert-bst-to-min-heap\/","og_locale":"en_US","og_type":"article","og_title":"Convert BST to Min Heap | Heap | Prepbytes","og_description":"BST (binary Search tree) is a data structure that supports insertion, deletion, and searching operations efficiently. In this article you will learn how to convert BST to min heap.","og_url":"https:\/\/prepbytes.com\/blog\/convert-bst-to-min-heap\/","og_site_name":"PrepBytes Blog","article_publisher":"https:\/\/www.facebook.com\/prepbytes0211\/","article_published_time":"2022-06-21T09:26:30+00:00","article_modified_time":"2022-12-14T07:41:02+00:00","og_image":[{"url":"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1655802414777-Convert%20BST%20to%20Min%20Heap.jpg","type":"","width":"","height":""}],"author":"Prepbytes","twitter_card":"summary_large_image","twitter_misc":{"Written by":"Prepbytes","Est. reading time":"2 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/prepbytes.com\/blog\/convert-bst-to-min-heap\/#article","isPartOf":{"@id":"https:\/\/prepbytes.com\/blog\/convert-bst-to-min-heap\/"},"author":{"name":"Prepbytes","@id":"http:\/\/43.205.93.38\/#\/schema\/person\/3f7dc4ae851791d5947a7f99df363d5e"},"headline":"Convert BST to Min Heap","datePublished":"2022-06-21T09:26:30+00:00","dateModified":"2022-12-14T07:41:02+00:00","mainEntityOfPage":{"@id":"https:\/\/prepbytes.com\/blog\/convert-bst-to-min-heap\/"},"wordCount":323,"commentCount":0,"publisher":{"@id":"http:\/\/43.205.93.38\/#organization"},"image":{"@id":"https:\/\/prepbytes.com\/blog\/convert-bst-to-min-heap\/#primaryimage"},"thumbnailUrl":"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1655802414777-Convert%20BST%20to%20Min%20Heap.jpg","keywords":["binary search tree","heap","tree"],"articleSection":["Trees"],"inLanguage":"en-US","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/prepbytes.com\/blog\/convert-bst-to-min-heap\/#respond"]}]},{"@type":"WebPage","@id":"https:\/\/prepbytes.com\/blog\/convert-bst-to-min-heap\/","url":"https:\/\/prepbytes.com\/blog\/convert-bst-to-min-heap\/","name":"Convert BST to Min Heap | Heap | Prepbytes","isPartOf":{"@id":"http:\/\/43.205.93.38\/#website"},"primaryImageOfPage":{"@id":"https:\/\/prepbytes.com\/blog\/convert-bst-to-min-heap\/#primaryimage"},"image":{"@id":"https:\/\/prepbytes.com\/blog\/convert-bst-to-min-heap\/#primaryimage"},"thumbnailUrl":"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1655802414777-Convert%20BST%20to%20Min%20Heap.jpg","datePublished":"2022-06-21T09:26:30+00:00","dateModified":"2022-12-14T07:41:02+00:00","description":"BST (binary Search tree) is a data structure that supports insertion, deletion, and searching operations efficiently. In this article you will learn how to convert BST to min heap.","breadcrumb":{"@id":"https:\/\/prepbytes.com\/blog\/convert-bst-to-min-heap\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/prepbytes.com\/blog\/convert-bst-to-min-heap\/"]}]},{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/prepbytes.com\/blog\/convert-bst-to-min-heap\/#primaryimage","url":"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1655802414777-Convert%20BST%20to%20Min%20Heap.jpg","contentUrl":"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1655802414777-Convert%20BST%20to%20Min%20Heap.jpg"},{"@type":"BreadcrumbList","@id":"https:\/\/prepbytes.com\/blog\/convert-bst-to-min-heap\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"http:\/\/43.205.93.38\/"},{"@type":"ListItem","position":2,"name":"Trees","item":"https:\/\/prepbytes.com\/blog\/category\/tree\/"},{"@type":"ListItem","position":3,"name":"Convert BST to Min Heap"}]},{"@type":"WebSite","@id":"http:\/\/43.205.93.38\/#website","url":"http:\/\/43.205.93.38\/","name":"PrepBytes Blog","description":"ONE-STOP RESOURCE FOR EVERYTHING RELATED TO CODING","publisher":{"@id":"http:\/\/43.205.93.38\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"http:\/\/43.205.93.38\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"},{"@type":"Organization","@id":"http:\/\/43.205.93.38\/#organization","name":"Prepbytes","url":"http:\/\/43.205.93.38\/","logo":{"@type":"ImageObject","inLanguage":"en-US","@id":"http:\/\/43.205.93.38\/#\/schema\/logo\/image\/","url":"https:\/\/blog.prepbytes.com\/wp-content\/uploads\/2025\/07\/uzxxllgloialmn9mhwfe.webp","contentUrl":"https:\/\/blog.prepbytes.com\/wp-content\/uploads\/2025\/07\/uzxxllgloialmn9mhwfe.webp","width":160,"height":160,"caption":"Prepbytes"},"image":{"@id":"http:\/\/43.205.93.38\/#\/schema\/logo\/image\/"},"sameAs":["https:\/\/www.facebook.com\/prepbytes0211\/","https:\/\/www.instagram.com\/prepbytes\/","https:\/\/www.linkedin.com\/company\/prepbytes\/","https:\/\/www.youtube.com\/channel\/UC0xGnHDrjUM1pDEK2Ka5imA"]},{"@type":"Person","@id":"http:\/\/43.205.93.38\/#\/schema\/person\/3f7dc4ae851791d5947a7f99df363d5e","name":"Prepbytes","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"http:\/\/43.205.93.38\/#\/schema\/person\/image\/","url":"https:\/\/secure.gravatar.com\/avatar\/232042cd1a1ea0e982c96d2a2ec93fb70a8e864e00784491231e7bfe5a9e06b5?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/232042cd1a1ea0e982c96d2a2ec93fb70a8e864e00784491231e7bfe5a9e06b5?s=96&d=mm&r=g","caption":"Prepbytes"},"url":"https:\/\/prepbytes.com\/blog\/author\/gourav-jaincollegedekho-com\/"}]}},"_links":{"self":[{"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/posts\/8552","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/users\/52"}],"replies":[{"embeddable":true,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/comments?post=8552"}],"version-history":[{"count":7,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/posts\/8552\/revisions"}],"predecessor-version":[{"id":8880,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/posts\/8552\/revisions\/8880"}],"wp:attachment":[{"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/media?parent=8552"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/categories?post=8552"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/tags?post=8552"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}