Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

// TreapNode class implementation #include "TreapNode.h" TreapNode::TreapNode(int key, int priority, TreapNode* left, TreapNode* right) : key_(key), priority_ (priority), left_(left), right_(right) {} int TreapNode::get_key() const { return key_; } int TreapNode::get_priority() const { return priority_; } const TreapNode* TreapNode::get_left() const { return left_; } const TreapNode* TreapNode::get_right() const { return right_; }