Jayanth H Sjayanthhs.hashnode.dev·Sep 25, 2023Convert BST to Max HeapGiven a Binary Search Tree which is also a Complete Binary Tree. The problem is to convert a given BST into a Special Max Heap with the condition that all the values in the left subtree of a node should be less than all the values in the right subtre...47 readsalgorithms