Identify and explain what BST entails and discuss its advantages and disadvantages.  

Binary Search Tree (BST) is a data structure commonly used in computer science to store and organize items. It uses the principle of “divide & conquer” which is used to quickly locate and access items within the tree. A BST consists of nodes, each containing a key value that is greater than all keys stored at its left subtree and less than all the keys stored at its right subtree.

The advantages of using this data structure are that it works well with large datasets, has fast search times since it only needs to traverse half of the tree, can be easily implemented with recursive algorithms, and allows for easy insertion or deletion without having to re-balance the entire tree.

On the other hand, there are some disadvantages associated with BSTs as well. These include higher memory usage due to additional pointers being needed for each node; more complex implementation compared to linked lists; more difficult implementation compared to hash tables when dealing with non-unique keys; inefficient use of space if items need frequent updates or deletions; and worst case scenarios where access time becomes O(n).

Overall, Binary Search Trees offer efficient searching capabilities when implemented correctly making them a popular choice among developers when building applications involving large datasets where performance is paramount.