Ilyas on Instagram: "I put a message at the end of the vid !! ... A heap sort is a comparison-based sorting technique that uses a binary heap data structure. It is an in-place algorithm, meaning it doesn't require extra memory beyond what is needed for input, and it achieves an optimal O(n \log n) time complexity by first building a max-heap or min-heap from the input array and then repeatedly extracting the maximum (or minimum) element. A Binary Search Tree (BST) is a node-based data structure