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

Today, I will talk to you about the implementation of the binary search tree, which may not be well understood by many people. in order to make you understand better, the editor has summarized the following content for you. I hope you can get something according to this article.

There is a way to realize the binary search tree, which is realized by a linked list, which is a discontinuous and non-sequential storage structure on a physical storage unit, and the logical order of data elements is realized through the linking order of pointers in the linked list. and the linked list is composed of a series of nodes, which can be generated dynamically at run time.

Binary search tree

Binary search tree (Binary Search Tree) is a special binary tree which is useful for sorting and searching.

Definition: left subtree < root node < right subtree

Implementation method: generally implemented by linked list

Operation set: create binary tree, determine whether it is empty, traverse, find, find the smallest element, find the largest element, insert, delete

Time complexity: the best O (logN) the worst O (N)

Related introduction:

The linked list is a non-continuous and non-sequential storage structure on the physical storage unit, and the logical order of data elements is realized by the pointer link order in the linked list. The linked list consists of a series of nodes (each element in the linked list is called a node), and the node can be generated dynamically at run time. Each node consists of two parts: one is the data field in which the data elements are stored, and the other is the pointer domain in which the address of the next node is stored. Compared with the sequential structure of linear table, the operation is complex. Because it does not have to be stored sequentially, linked lists can achieve O (1) complexity when inserting, which is much faster than another linear table sequential table, but it takes O (n) time to find a node or access a specific numbered node, while the corresponding time complexity of linear table and sequential table is O (logn) and O (1), respectively.

Using the linked list structure can overcome the disadvantage that the array linked list needs to know the data size in advance, and the linked list structure can make full use of the computer memory space to realize flexible memory dynamic management. However, the linked list loses the advantage of random reading of the array, and the linked list has a large space overhead due to the increase of the pointer domain of the node. The most obvious advantage of linked lists is that regular arrays may arrange associated items differently from the order of these data items on memory or disk, and data access often has to be converted in a different order. Linked lists allow you to insert and remove nodes anywhere on the table, but do not allow random access. There are many different types of linked lists: unidirectional linked lists, two-way linked lists, and circular linked lists. Linked lists can be implemented in many programming languages. Linked list access and manipulation are included in the built-in data types of languages such as Lisp and Scheme. Programming languages or object-oriented languages such as Cpene Clipper + and Java rely on mutable tools to generate linked lists.

After reading the above, do you have any further understanding of the implementation of the binary search tree? If you want to know more knowledge or related content, please follow the industry information channel, thank you for your support.

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.