properties of a BST.

A Binary Search Tree (BST) is a tree in which all the nodes follow the below properties:

1. The left sub-tree of a node has a key less than or equal to its parent node's key.
2. The right sub-tree of a node has a key greater than to its parent node's key.
3. This property must be true for all nodes in the tree.

Other properties of a BST include:

4. No duplicate nodes: A BST does not contain duplicate nodes. This is because of the property that the left child must be less than the parent and the right child must be greater than the parent.

5. Search property: Searching is faster in a BST. This is because of the binary property, which allows the tree to eliminate half of the tree at each level.

6. Inorder traversal of BST retrieves elements in sorted order.

7. The height of a binary search tree determines the worst-case and average case complexity for most operations. If the tree is balanced, operations like search, insertion and deletion take O(log n) time. If the tree is a straight line (like a linked list), these operations take O(n) time.

8. BSTs are used in many search applications where data is constantly entering and leaving.