An optimal search tree: complete binary search tree

Authors:
Narayan Murthy
Affiliations:
Pace University, Pleasantville, NY
Venue:
CSC '89 Proceedings of the 17th conference on ACM Annual Computer Science Conference
Year:
1989

Citing 2
Cited 1

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

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Algorithms + Data Structures = Programs

Algorithms + Data Structures = Programs

An optimal search tree: modified complete binary search tree

ACM-SE 36 Proceedings of the 36th annual Southeast regional conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

Definitions and properties of a complete binary tree and a binary search tree are well known [1]. This short paper discusses a method to construct a binary search tree which is also a complete binary tree. We call such a tree a Complete Binary Search Tree, a CBS Tree for short. Two basic advantages of a CBS tree are that it is a search tree with minimum height and that it can be placed in an array. The latter allows for implementation of the data structure without the use of pointers.