Are binary search trees the same as binary sort trees?

Binary search tree and binary sorting tree are the same. The full English name is "Binary Search Tree". As a classic data structure, binary search tree has fast insertion and deletion operations of linked lists. features, and has the advantage of fast array search.

#Binary search tree and binary sorting tree are the same.

Binary Search Tree (Binary Search Tree), (also: binary search tree, binary sorting tree) it is either an empty tree, or a binary tree with the following properties: If it The left subtree of is not empty, then the values ​​of all nodes on the left subtree are less than the value of its root node; if its right subtree is not empty, then the values ​​of all nodes on the right subtree are greater than its root node The value of the root node; its left and right subtrees are also binary sorted trees respectively. As a classic data structure, binary search tree has the characteristics of fast insertion and deletion operations of linked lists, and the advantage of fast search of arrays. Therefore, it is widely used. For example, it is generally used in file systems and database systems. Data structures perform efficient sorting and retrieval operations.

Binary search tree is a data structure that can efficiently perform the following operations.

1. Insert a value

2. Query whether a certain value is included

3. Delete a certain value

The above is the detailed content of Are binary search trees the same as binary sort trees?. For more information, please follow other related articles on the PHP Chinese website!