Randomly balanced binary trees

DOI10.1007/BF02576649MaRDI QIDQ1151048zbMATH OpenFDO

Authors Renzo Sprugnoli

Publication date 1980

Published in Calcolo (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02576649

zbMATH Keywords

average searching timebinary search treesinsertion algorithm

Mathematics Subject Classification ID

Searching and sorting (68P10)

Cites work

• A principle of independence for binary tree searching
• Efficiency of a Binary Comparison Storage Technique
• scientific article; zbMATH DE number 3466516 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• scientific article; zbMATH DE number 3096283 (Why is no real title available?)
• More Combinatorial Properties of Certain Trees
• Multidimensional binary search trees used for associative searching
• Self-Organizing Binary Search Trees

This page was built for publication: Randomly balanced binary trees

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