Elsevier

Journal of Algorithms

Volume 7, Issue 3, September 1986, Pages 395-411
Journal of Algorithms

On deletion in threaded binary trees

https://doi.org/10.1016/0196-6774(86)90030-1Get rights and content

Abstract

We determine the explicit performance of deletion algorithms which have to maintain threads in a binary tree. In particular, it is shown that the cost of threads on deletion is not as high as might be expected, and is especially low for right-threaded trees. The results are obtained by using recurrences to compute the average cost of deleting a single node from both threaded and unthreaded trees. As an illustration of the technique, a new derivation of the average cost of insertion into binary search trees is presented.

References (8)

  • K Brinck et al.

    Analysis of algorithms on threaded trees

    Comput. J.

    (1981)
  • K Brinck

    The expected performance of traversal algorithms in binary trees

    Comput. J.

    (1985)
  • T Hibbard

    Some combinatorial properties of certain trees

    J. Assoc. Comput. Mach.

    (1962)
  • D.W Knuth

    Fundamental Algorithms

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

Cited by (5)

  • Emerging behavior as binary search trees are symmetrically updated

    2003, Theoretical Computer Science

  • Emerging behavior as binary search trees are symmetrically updated

    2000, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  • A characterization of binary search networks

    1991, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  • Counting labels in binary trees

    1990, BIT

  • A Compendium of Key Search References

    1990, ACM SIGIR Forum
View full text
Copyright © 1986 Published by Elsevier Inc.