Binary Search Tree

A Binary Search Tree (BST) is a data structure used for storing data in a sorted manner.

Properties:

• Each node in a BST has at most 2 children, a left child and a right child.
• Left child contains values less than or equal to the parent node.
• Right child contains values greater than the parent node.

This structure allows for efficient searching, insertion, and deletion operations on data in tree.