A Binary Search Tree (BST) is a data structure that stores data in a hierarchical form. It is composed of nodes, each of which stores a value and links to two other nodes.
Priority Queue is a special type of queue data structure that holds elements in order of their priority. In Java, it is implemented using PriorityQueue class.
Bubble Sort is a simple sorting algorithm that repeatedly steps through a list, comparing adjacent elements and swapping them if they are in the wrong order.