Yes they are useful but most languages already have inbuilt implementation(s) of Balanced BST.(set and map in C++). Some problems may require you to argument a BST in which the inbuilt implementation may not work but these are very rare.
Which is the most efficient implementations of a priority queue using binary trees, please provide the algorithm along with sample code.
