Marek Chrobák

A Tight Threshold Bound for Search Trees with 2-way Comparisons

2023 · arXiv (Cornell University)

We study search trees with 2-way comparisons (2WCST's), which involve separate less-than and equal-to tests in their nodes, each test having two possible outcomes, yes and no. These trees have a much subtler structure than …