Comments on “Concurrent Search and Insertion in AVL Trees”

Research output: Contribution to journalArticle


Ellis' concurrent AVL insertion algorithm' is discussed in this correspondence. We note that obtaining a block of storage for the new AVL leaf may become a serial bottleneck for the entire insertion algorithm. We indicate a potential solution and refer the reader to another paper [1] in which the full details are given.

Original languageEnglish (US)
Pages (from-to)812
Number of pages1
JournalIEEE Transactions on Computers
Issue number10
StatePublished - 1981


ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Hardware and Architecture
  • Software
  • Theoretical Computer Science

Cite this