Elsevier

Information Sciences

Volume 74, Issue 3, November 1993, Pages 275-282
Information Sciences

A new representation of binary search trees

https://doi.org/10.1016/0020-0255(93)90100-ZGet rights and content

Abstract

The binary search tree is one of the most fundamental data structures in computer and information sciences. This paper presents a simple and powerful representation of binary search trees. This representation uses the concept of implicit data structures, and it has many useful applications in constructing information systems that support efficient and flexible dynamic search, enumeration, and update operations.

References (8)

  • A.V. Aho et al.

    Data Structures and Algorithms

    (1983)
  • J.I. Bentley

    Multidimensional binary search trees used for associative searching

    Commun. ACM

    (1975)
  • K. Brinck

    The expected performance of traversal algorithms in binary trees

    Comput. J.

    (1985)
  • K. Brinck et al.

    Analysis of algorithms on threaded trees

    Comput. J.

    (1981)
There are more references available in the full text version of this article.

Cited by (0)

View full text
Copyright © 1993 Published by Elsevier Inc.