A simple balanced search tree

Authors:
Porter Eugene Smith;James H. Graham
Affiliations:
Bellarmine College, Computer Science Dept., Louisville, KY;Univ. of Louisville, Speed School - EMACS Dept., Louisville, KY
Venue:
CSC '93 Proceedings of the 1993 ACM conference on Computer science
Year:
1993

Citing 8
Cited 0

The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Binary Search Trees and File Organization

ACM Computing Surveys (CSUR)
Ubiquitous B-Tree

ACM Computing Surveys (CSUR)
B-trees re-examined

Communications of the ACM
Pagination of B*-trees with variable-length records

Communications of the ACM
Performance of height-balanced trees

Communications of the ACM
Information retrieval: information storage and retrieval using AVL trees

ACM '65 Proceedings of the 1965 20th national conference
The multics system: an examination of its structure

The multics system: an examination of its structure

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper provides a simple data structure and algorithm to create a balanced binary search tree that may be useful as an index for stored data or for other purposes. Its search and insertion time complexities are both O(log N) where N is the number of keys that it contains. The interesting feature of this data structure is that it is easy to visualize and understand. This structure could provide a friendly introduction to the study of balanced tree structures. Performance characteristics are sufficient that it could be appropriate in medium sized applications where small code size is important.