On a recursion connected with tree balancing algorithms

DOI10.1016/0020-0190(87)90184-0MaRDI QIDQ1108022zbMATH OpenOpenAlexFDO

Authors D. C. Van Leijenhorst, Theo P. van der Weide

Publication date 1987

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(87)90184-0

zbMATH Keywords

recurrence relationtime complexitybinary search treebalanced tree

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10) Radix representation; digital problems (11A63) Recurrences (11B37)

Cites work

• scientific article; zbMATH DE number 3481857 (Why is no real title available?)
• scientific article; zbMATH DE number 3443655 (Why is no real title available?)
• A Note on Gray Code and Odd-Even Merge
• Combinatorial solutions of multidimensional divide-and-conquer recurrences
• Sur la fonction sommatoire de la fonction 'somme des chiffres'

Cited in

(5)

• scientific article; zbMATH DE number 5046289 (Why is no real title available?)
• Binary search tree recursions with harmonic toll functions
• A typical vertex of a tree
• scientific article; zbMATH DE number 2044508 (Why is no real title available?)
• Balanced trees with removals: An exercise in rewriting and proof

This page was built for publication: On a recursion connected with tree balancing algorithms

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