Comments on "Concurrent Search and Insertion in AVL Trees"
Gottlieb · IEEE Transactions on Computers · 1981
Ellis' concurrent AVL insertion algorithm1is 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.