Interleave lower bound
id:
interleave-lower-bound-273-14624306
title:
Interleave lower bound
text:
In the theory of optimal binary search trees, the interleave lower bound is a lower bound on the number of operations required by a Binary Search Tree (BST) to execute a given sequence of accesses. Several variants of this lower bound have been proven. This article is based on a variation of the first Wilber's bound. This lower bound is used in the design and analysis of Tango tree. Furthermore, this lower bound can be rephrased and proven geometrically, Geometry of binary search trees.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Interleave_lower_bound
date created:
date modified:
2022-08-07T13:02:48Z
main entity:
{"identifier":"Q25303770","url":"https://www.wikidata.org/entity/Q25303770"}
image:
fields total:
13
integrity:
13