Michael Wallner. A bijection of plane increasing trees with relaxed binary trees of right height at most one. Theoretical Computer Science, 755:1-12, 2019. [doi]
@article{Wallner19,
title = {A bijection of plane increasing trees with relaxed binary trees of right height at most one},
author = {Michael Wallner},
year = {2019},
doi = {10.1016/j.tcs.2018.06.053},
url = {https://doi.org/10.1016/j.tcs.2018.06.053},
researchr = {https://researchr.org/publication/Wallner19},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {755},
pages = {1-12},
}