Editing Binary search tree (section)

===Priority queue operations===
{{main|Priority queue}}
Binary search trees are used in implementing [[priority queue]]s, using the node's key as priorities. Adding new elements to the queue follows the regular BST insertion operation but the removal operation depends on the type of priority queue:<ref>{{cite web|publisher=[[Cornell University]], [[Cornell University College of Engineering|Department of Computer Science]]|first=Andrew|last=Myers|title=CS 2112 Lecture and Recitation Notes: Priority Queues and Heaps|url=https://www.cs.cornell.edu/courses/cs4120/2016sp/lectures/lec_heaps/|archive-date=21 October 2021|url-status=live|archive-url=https://web.archive.org/web/20211021202727/https://www.cs.cornell.edu/courses/cs4120/2016sp/lectures/lec_heaps/|access-date=21 October 2021}}
</ref>
* If it is an ascending order priority queue, removal of an element with the lowest priority is done through leftward traversal of the BST.
* If it is a descending order priority queue, removal of an element with the highest priority is done through rightward traversal of the BST.