Binary Search Trees

Michal Mankowski*, Mikhail Moshkov

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

Knuth in [4] studied the problem of average depth minimization for binary search trees with two kinds of keys related to successful and unsuccessful search with their probabilities.

Original languageEnglish (US)
Title of host publicationStudies in Systems, Decision and Control
PublisherSpringer Science and Business Media Deutschland GmbH
Pages87-97
Number of pages11
DOIs
StatePublished - 2021

Publication series

NameStudies in Systems, Decision and Control
Volume331
ISSN (Print)2198-4182
ISSN (Electronic)2198-4190

ASJC Scopus subject areas

  • Computer Science (miscellaneous)
  • Control and Systems Engineering
  • Automotive Engineering
  • Social Sciences (miscellaneous)
  • Economics, Econometrics and Finance (miscellaneous)
  • Control and Optimization
  • Decision Sciences (miscellaneous)

Fingerprint

Dive into the research topics of 'Binary Search Trees'. Together they form a unique fingerprint.

Cite this