Introduction - If you have any usage issues, please Google them yourself
Binary Search Tree (Binary Search Tree) is to meet the nature of the binary tree as follows: ① If its non-empty left subtree, then the left sub-tree of all nodes is less than the value of the value of root node ② if it the right subtree is not empty, then the right sub-tree of all nodes greater than the value of the value of root node ③ the left and right subtree is the tree itself is the binary search tree.