사용자 정의 클래스에서 Compare연산을 위한 연산자 작성에 대해..

class Node {
public:
	// Ctor
	Node() : _freq(0), _char('\0'), _left(0), _right(0) {}
	Node(const int& f, const char& c) : _freq(f), _char(c) {}
 
	// Copy Ctor
	Node(const Node& x) : _freq(x._freq), _char(x._char) {}
 
	// Dtor
	virtual ~Node() {}
 
	// Get methods
	int getFreq() 	{	return _freq;	}
	char getChar()	{	return _char;	}
	// Set methods
	void setFreq(const int& f) {	_freq = f;	}
	void setChar(const char& c){	_char = c;	}
	void setLeft(Node* l){	_left = l;	}
	void setRight(Node* r){	_right = r;	}
 
	// Operator override
	bool operator==(const Node& x) {
		return (this->_freq == x._freq && this->_char == x._char);
	}
	bool operator<(const Node& x) {
		if(this->_freq < x._freq) return true;
		else return false;
	}
	bool operator>(const Node& x) {
		if(this->_freq > x._freq) return true;
		else return false;
	}
 
 
private:
	int _freq;
	char _char;
	Node* _left;
	Node* _right;
};

// Container adaptor of priority queue
template <typename T, typename Container = vector<T>, 
	    typename Compare = less<typename Container::value_type> >
class pQueue {
    blahblah...
    blahblah...
private:
 
// internal values
	int _heapsize;	
	T _buf;
	Container _container;
//	Compare (*_compare)(const T& x, const T& y);
 
}

pQueue<Node> list1;

pQueue<Node, vector<Node>, greater<Node> > list;