Deletion Without Rebalancing in Binary Search Trees
From MaRDI portal
Publication:4962624
DOI10.1145/2903142zbMath1445.68074OpenAlexW2510324744MaRDI QIDQ4962624
David H. Kim, Siddhartha Sen, Robert Endre Tarjan
Publication date: 5 November 2018
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2903142
algorithmamortized complexitydata structurebalanced treesexponential potential functiondatabase access methods
This page was built for publication: Deletion Without Rebalancing in Binary Search Trees