摘要
Abstract
Aiming at the efficiency problem of binary search tree in dynamic data retrieval,the dynamic adjustment algorithm and the optimization technique of the best binary sorting tree were studied.On the basis of analyzing the existing applications and performance bottlenecks of binary search trees,an optimization method was proposed to keep the tree structure balanced by dynamic adjustment,especially the introduction of dynamic optimal binary sorting tree(OBST),which significantly improved the retrieval efficiency by adjusting the high-frequency nodes.This paper also compared the performance of balanced binary trees and optimal binary sorting trees,and illustrates the advantages of optimal binary sorting trees in handling large-scale data.Finally,the prospect of binary search trees in large-scale data processing was explored.关键词
二叉搜索树/动态调整算法/最优二叉搜索树/数据检索/树结构优化Key words
binary search tree/dynamic adjustment algorithm/optimal binary search tree/data retrieval/tree structure optimization分类
信息技术与安全科学
