The height of a binary search tree: the limiting distribution perspective

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.289, Iss.1, 2002-10, pp. : 649-703

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

The Variance of the height of binary search trees

By Drmota M.

Theoretical Computer Science, Vol. 270, Iss. 1, 2002-01 ,pp. : 913-919

Elsevier

Access to resources Recommend Favorite

Constant bounds on the moments of the height of binary search trees

By Robson J.M.

Theoretical Computer Science, Vol. 276, Iss. 1, 2002-04 ,pp. : 435-444

Elsevier

Access to resources Recommend Favorite

Lock-Free Binary Search Tree Based on Leaf Search

International Journal of Open Source Software and Processes (IJOSSP), Vol. 8, Iss. 2, 2017-04 ,pp. : 44-58

IGI Global_journal

Access to resources Recommend Favorite

High Performance CGM-based Parallel Algorithms for the Optimal Binary Search Tree Problem

International Journal of Grid and High Performance Computing (IJGHPC), Vol. 8, Iss. 4, 2016-10 ,pp. : 55-77

IGI Global_journal

Access to resources Recommend Favorite

The Random Multisection Problem, Travelling Waves and the Distribution of the Height of m-Ary Search Trees

By Chauvin Brigitte Drmota Michael

Algorithmica, Vol. 46, Iss. 3-4, 2006-11 ,pp. : 299-327

Springer Publishing Company

Access to resources Recommend Favorite