Balanced search trees made simple (Q5060098)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7643373

Language	Label	Description	Also known as
English	Balanced search trees made simple	scientific article; zbMATH DE number 7643373

Statements

scholarly article

0 references

Balanced search trees made simple (English)

0 references

Lecture Notes in Computer Science

0 references

publication date

18 January 2023

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/3-540-57155-8_236

0 references

0 references

Binary search trees of almost optimal height

0 references

Symmetric binary B-trees: Data structure and maintenance algorithms

0 references

Implementing dictionaries using binary trees of very small height

0 references

0 references

Binary Search Trees of Bounded Balance

0 references

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/3-540-57155-8_236

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5060098

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5060098&oldid=37479394"