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

DOI10.1016/S0020-0190(99)00106-4zbMATH Open0999.68046OpenAlexW2095237626MaRDI QIDQ1606975FDOQ1606975

Authors: Rainer Kemp 

Publication date: 25 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(99)00106-4

zbMATH Keywords

binary treesleftist trees

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Cited In (3)

• One-sided interval trees
• On the representation of simply generated trees by leftist trees
• The scientific works of Rainer Kemp (1949--2004)

This page was built for publication: A one-to-one correspondence between a class of leftist trees and binary trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1606975)