Generalizing a Theorem of Wilber on Rotations in Binary Search Trees to Encompass Unordered Binary Trees

ISSN： 0178-4617

Source： Algorithmica, Vol.62, Iss.3-4, 2012-04, pp. : 863-878

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

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

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

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

New lower bounds on the cost of binary search trees

By De Prisco R. De Santis A.

Theoretical Computer Science, Vol. 156, Iss. 1, 1996-03 ,pp. : 315-325

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