On a recursion connected with tree balancing algorithms

DOI10.1016/0020-0190(87)90184-0zbMath0653.68056OpenAlexW2066738069MaRDI QIDQ1108022

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

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

Cites Work

• Unnamed Item
• Unnamed Item
• Sur la fonction sommatoire de la fonction 'somme des chiffres'
• Combinatorial solutions of multidimensional divide-and-conquer recurrences
• A Note on Gray Code and Odd-Even Merge

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