The basic concept of binary search tree

Binary Search Tree (BST), also known as Binary Sort Tree or Binary Search Tree
Binary Search Tree: A binary tree can be empty; if it is not empty, it satisfies the following properties

1. All the key values ​​of the non-empty left subtree are less than the key value of its root node
2. All the key values ​​of the non-empty right subtree are greater than the key value of its root node
3. The left and right subtrees are binary search trees