English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Open

Presents the pdf analysis as premium feature

PDF Analysis

Insights

Presents the summarisation as premium feature

Summarisation

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

We consider the problem on constructing a binary search tree for an arbitrary set of binary words, which has found a wide use in informatics, biology, mineralogy, and other fields. It is known that the problem on constructing the tree of minimal cost is NP-complete; hence the problem arises to find simple algorithms which allow us to construct trees close to the optimal ones. In this paper we demonstrate that even simplest algorithm yields search trees which are close to the optimal ones in average, and prove that the mean number of nodes checked in the optimal tree differs from the natural lower bound, the binary logarithm of the number of words, by no more than 1.04.

An estimate of mean efficiency of search trees for arbitrary sets of binary words