Balanced search trees made simple

DOI10.1007/3-540-57155-8_236zbMATH Open1504.68041OpenAlexW1542185767WikidataQ56060741 ScholiaQ56060741MaRDI QIDQ5060098FDOQ5060098

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

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

Mathematics Subject Classification ID

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

Cites Work

• Symmetric binary B-trees: Data structure and maintenance algorithms
• Binary Search Trees of Bounded Balance
• Binary search trees of almost optimal height
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Implementing dictionaries using binary trees of very small height

Cited In (8)

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

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)