The story’s score and claims

Comments on No. 20 of 62 · arXiv · edition of Sunday 15 November 2026

A Binary Search Tree with the Unified Bound

Summary

Yang Cao, Haoran Qi and Hanzhi Wang give a deterministic online binary search tree that serves m searches in O(m + UB(X)), where UB is Iacono's unified bound, and each search in O(log n). Earlier trees paid an extra m log log n, and none was known to meet the bound even offline. The tree keeps recently searched key blocks at power-of-two scales in a biased search tree. It also gives O((m+n)(1+log c_σ)) on pattern-avoiding sequences and handles insertions and deletions. The results are theoretical and unreviewed.

Comments

Ranked by a public rubric, not by votes: what a comment adds counts, not who wrote it. How comments are ranked · Comment rules