优先级队列的实现 和 层次遍历建树

#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

class priority_queue
{
private:
    vector<int> data;

public:
    void push(int t){
        data.push_back(t);
        push_heap(data.begin(), data.end());
    }

    void pop(){
        pop_heap(data.begin(), data.end());
        data.pop_back();
    }

    int top() { return data.front(); }
    int size() { return data.size(); }
    bool empty() { return data.empty(); }
};


int main()
{
    priority_queue test;
    test.push(3);
    test.push(5);
    test.push(2);
    test.push(4);

    while (!test.empty()){
        cout << test.top() << endl;
        test.pop();
    }

    return 0;

}

View Code