Shulou(Shulou.com)06/03 Report--

This article will explain in detail what is a binary search tree, the content of the article is of high quality, so the editor will share it for you as a reference. I hope you will have a certain understanding of the relevant knowledge after reading this article.

Binary search tree is also called binary search tree or binary sort tree. A binary search tree is organized by a binary tree and can be represented by a linked list data structure, in which each node is an object; generally speaking, in addition to key and satellite data, each node also contains attributes lchild, rchild and parent.

Binary search tree (Binary Search Tree), (again: binary search tree, binary sort tree) it is either an empty tree or a binary tree with the following properties: if its left subtree is not empty, then the value of all nodes on the left subtree is less than the value of its root node; if its right subtree is not empty, then the value of all nodes on the right subtree is greater than the value of its root node; its left and right subtrees are also binary sorting trees. As a classical data structure, binary search tree not only has the characteristics of fast insertion and deletion of linked lists, but also has the advantage of fast array search, so it is widely used. for example, this data structure is generally used for efficient sorting and retrieval operations in file systems and database systems.

Principle

Binary search tree (BST) is also called binary search tree or binary sort tree. A binary search tree is organized as a binary tree and can be represented by a linked list data structure, where each node is an object. In general, in addition to key and satellite data, each node contains attributes lchild, rchild, and parent, pointing to the node's left child, right child, and parent (parent node), respectively. If a child node or parent node does not exist, the value of the corresponding property is NIL. The root node is the only node in the tree whose parent pointer is NIL, while the child node pointer of the leaf node is NIL.

structure

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

1. Insert a numeric value

two。 Query whether it contains a numerical value

3. Delete a numeric value

On what is a binary search tree to share here, I hope that the above content can be of some help to you, can learn more knowledge. If you think the article is good, you can share it for more people to see.

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.