What is BST?

BST most likely refers to a Binary Search Tree. A Binary Search Tree is a tree data structure where each node has at most two children, referred to as the left child and the right child. The left child's value is less than or equal to the parent node's value, and the right child's value is greater than the parent node's value. Binary Search Trees are commonly used for efficient searching, insertion, and deletion of elements in a sorted manner. They are often used to implement sets and maps.