Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Non-recursive high-performance construction method of balanced binary tree

A technology of balancing binary trees and construction methods, applied in the field of non-recursive high-performance construction, can solve problems affecting performance and system performance, and achieve the effect of reducing algorithm time-consuming

Inactive Publication Date: 2021-08-31
江苏未来智慧信息科技有限公司
View PDF0 Cites 3 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

This situation has little impact on system performance when the amount of data is low. Once the number of duplicate node records increases, performance will be seriously affected.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Non-recursive high-performance construction method of balanced binary tree
  • Non-recursive high-performance construction method of balanced binary tree
  • Non-recursive high-performance construction method of balanced binary tree

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0042] The following will clearly and completely describe the technical solutions in the embodiments of the present invention with reference to the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only some, not all, embodiments of the present invention. Based on the embodiments of the present invention, all other embodiments obtained by persons of ordinary skill in the art without making creative efforts belong to the protection scope of the present invention.

[0043] Such as Figure 1-4 As shown, a non-recursive high-performance construction method of a balanced binary tree, establishes a database server, a node increase server, a node deletion server and a balanced binary tree construction server, establishes a NOSQL database of a HASH table in the database server and provides a node query function;

[0044] The node increase server is used to receive the newly inserted data, and judge the total data volume of the ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a non-recursive high-performance construction method of a balanced binary tree, which belongs to the technical field of computer basic algorithms, and comprises the following steps: establishing a database server, a node adding server, a node deleting server and a balanced binary tree construction server; in constructing an AVL tree, the imbalance adjustment of the AVL tree comprises right-handed rotation adjustment, left-handed rotation adjustment, left-handed rotation and right-handed rotation adjustment and right-handed rotation and left-handed rotation adjustment, and the technical problem that the operation of adding, deleting and querying the AVL tree is achieved through a non-recursive method is solved. According to the method, for the querying occasion in which the AVL tree is required, the AVL tree can be generated with the efficiency similar to that of red-black tree generation, data query is carried out with the query efficiency about 10% higher than that of the red-black tree, the tree generation efficiency has no great advantage compared with a red-black tree algorithm, the method can be applied to occasions which are slightly insensitive to data generation time but have high requirements for query speed, and the algorithm time consumption is greatly reduced compared with a recursive algorithm.

Description

technical field [0001] The invention belongs to the technical field of basic computer algorithms, and relates to a non-recursive high-performance construction method of a balanced binary tree. Background technique [0002] A balanced binary tree (AVL tree) is a data structure commonly used in basic computer data structures. This data structure requires that the height difference between the left and right subtrees of any node in the tree does not exceed 1. Although the red-black tree in the current computer engineering application has more convenient and efficient insertion and deletion operations and the search efficiency close to the balanced binary tree in most cases, it replaces the balanced binary tree in most cases, making the balanced binary tree appear more in the data structure. teaching occasions. However, in some occasions where the query rate is very demanding, the balanced binary tree is still the optimal data structure choice. At present, most of the algorit...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
IPC IPC(8): G06F16/22
CPCG06F16/2246
Inventor 王凤雷王锋平林世颖时春
Owner 江苏未来智慧信息科技有限公司
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com