2008•Computer Knowledge and TechnologyRequires access

The Judgement and Adjustment to Highly Balanced Binary Search Tree

HU Zhi-qin

Abstract

The highly balanced binary search tree is established in order to improve efficiency of the binary search tree and to shorten the average search tree.Therefore,whenever a new node is inserted into the binary search tree,the tree structure has to be adjusted so that the binary search tree can maintain its balance,with both its height and average search length keeping at O(log2n).

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Self-balancing binary search tree, Binary search tree, Optimal binary search tree, Ternary search tree, Random binary tree, Computer science, Binary tree, Search tree