Left child node has value smaller than parent node and right child node has value bigger than parent node.

Search of element with the highest priority time complexity is O(log N).

Elements must be comparable by priority.

The values in child nodes have values smaller than parent node.

This is binary search tree.

Insertion time complexity is O(log N).

This is binary tree.

Root stores element with the highest priority.