Balanced search trees made simple

DOI10.1007/3-540-57155-8_236MaRDI QIDQ5060098zbMATH OpenOpenAlexWikidataFDO

Authors

Publication date 18 January 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-57155-8_236

Mathematics Subject Classification ID

Data structures (68P05) Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 437541
• Randomized search trees
• Self-adjusting binary search trees
• Red-black trees in a functional setting
• A new weight balanced binary search tree

Cites work

• scientific article; zbMATH DE number 3767009 (Why is no real title available?)
• scientific article; zbMATH DE number 3770965 (Why is no real title available?)
• scientific article; zbMATH DE number 140487 (Why is no real title available?)
• scientific article; zbMATH DE number 742983 (Why is no real title available?)
• Binary Search Trees of Bounded Balance
• Binary search trees of almost optimal height
• Implementing dictionaries using binary trees of very small height
• Symmetric binary B-trees: Data structure and maintenance algorithms

Cited in

(8)

• Revisiting 2-3 red-black trees with a pedagogically sound yet efficient deletion algorithm: parity-seeking
• More on balanced diets
• An assertional proof of red-black trees using Dafny
• A note on the largest number of red nodes in red-black trees
• Red-black trees with constant update time
• Measuring tree balance using symmetry nodes -- a new balance index and its extremal properties
• Large-scale linear rankSVM
• Red-black trees in a functional setting

This page was built for publication: Balanced search trees made simple

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5060098)