Trees, Forests and Rearranging

DOI10.1093/comjnl/3.2.84zbMath0093.31605OpenAlexW1994207414MaRDI QIDQ3270168

P. F. Windley

Publication date: 1960

Published in: The Computer Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/comjnl/3.2.84

zbMATH Keywords

numerical analysis

Related Items (11)

On file structuring for non-uniform access frequencies ⋮ An Improved Bound for Random Binary Search Trees with Concurrent Insertions ⋮ Optimal binary search methods ⋮ Analysis of the standard deletion algorithms in exact fit domain binary search trees ⋮ Sortierprozesse auf elektronischen Rechenanlagen ⋮ Profiles of random trees: correlation and width of random recursive trees and binary search trees ⋮ Sequence search trees: Their analysis using recurrence relations ⋮ Deletions in random binary search trees: a story of errors ⋮ A method for constructing binary search trees by making insertions at the root ⋮ Optimum binary search trees ⋮ The properties of random trees

This page was built for publication: Trees, Forests and Rearranging