Two New Kinds of Biased Search Trees
From MaRDI portal
Publication:3704898
DOI10.1002/j.1538-7305.1983.tb03469.xzbMath0582.68036MaRDI QIDQ3704898
No author found.
Publication date: 1983
Published in: Bell System Technical Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/j.1538-7305.1983.tb03469.x
05C05: Trees
68P10: Searching and sorting
68R10: Graph theory (including graph drawing) in computer science
68P05: Data structures
Related Items
Dynamic Planar Point Location in External Memory., Skip lift: a probabilistic alternative to red-black trees, The CB tree: a practical concurrent self-adjusting search tree, Skip Lift: A Probabilistic Alternative to Red-Black Trees, Efficient Construction of Near-Optimal Binary and Multiway Search Trees