A one-to-one correspondence between a class of leftist trees and binary trees

https://doi.org/10.1016/S0020-0190(99)00106-4Get rights and content

Abstract

We shall establish a systematic one-to-one correspondence between extended binary trees with m leaves and leftist 2,3-trees with m leaves.

References (0)

Cited by (3)

  • The scientific works of Rainer Kemp (1949-2004)

    2006, Theoretical Computer Science
  • The asymptotic number of leftist trees

    2001, Algorithmica (New York)
View full text