A one-to-one correspondence between a class of leftist trees and binary trees
We shall establish a systematic one-to-one correspondence between extended binary trees with m leaves and leftist 2,3-trees with m leaves. (C) 1999 Elsevier Science B.V. All rights reserved.
combinatorial problems data structures