Left and Right Pathlengths in Random Binary Trees

ISSN： 0178-4617

Source： Algorithmica, Vol.46, Iss.3-4, 2006-11, pp. : 419-429

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

Related content

Profiles of Random Trees: Limit Theorems for Random Recursive Trees and Binary Search Trees

By Fuchs Michael Hwang Hsien-Kuei Neininger Ralph

Algorithmica, Vol. 46, Iss. 3-4, 2006-11 ,pp. : 367-407

Springer Publishing Company

Access to resources Recommend Favorite

Limit laws for terminal nodes in random circuits with restricted fan-out: a family of graphs generalizing binary search trees

By Mahmoud Hosam Tsukiji Tatsuie

Acta Informatica, Vol. 41, Iss. 2-3, 2004-12 ,pp. : 99-110

Springer Publishing Company

Access to resources Recommend Favorite

Optimal binary search trees

By Nagaraj S.V.

Theoretical Computer Science, Vol. 188, Iss. 1, 1997-11 ,pp. : 1-44

Elsevier

Access to resources Recommend Favorite

A note on binary grammatical codes of trees

By Ehrenfeucht A. ten Pas P. Rozenberg G.

Theoretical Computer Science, Vol. 155, Iss. 2, 1996-03 ,pp. : 425-438

Elsevier

Access to resources Recommend Favorite

Randomized path coloring on binary trees

By Auletta V. Caragiannis I. Kaklamanis C. Persiano P.

Theoretical Computer Science, Vol. 289, Iss. 1, 2002-10 ,pp. : 355-399

Elsevier

Access to resources Recommend Favorite