How do I implement a heap in C++?

How do I implement a heap in C++?

To implement a heap in C++, you can use a vector to store the elements and maintain the heap property.

What are the differences between a min-heap and a max-heap?

A min-heap ensures that the parent node is less than or equal to its children, while a max-heap does the opposite.

Can you show me a code example for a min-heap?

Sure! Here's a simple implementation of a min-heap using a vector:

#include <vector>
#include <iostream>

class MinHeap {
private:
    std::vector<int> heap;

    void heapifyUp(int index) {
        // Implementation of heapify up
    }

    void heapifyDown(int index) {
        // Implementation of heapify down
    }

public:
    void insert(int value) {
        // Insert value and maintain heap property
    }

    int extractMin() {
        // Extract the minimum element
    }
};

This is a basic structure; you can fill in the heapify methods.

What are the time complexities for insertion and extraction?

Both insertion and extraction in a heap have a time complexity of O(log n) due to the need to maintain the heap property.