@article{oai:u-nagano.repo.nii.ac.jp:00000400,
 author = {清水, 道夫 and Shimizu, Michio},
 journal = {長野県短期大学紀要, Journal of Nagano Prefectural College},
 month = {Dec},
 note = {40002771520, application/pdf, We show one-one correspondence between all binary trees with n internal nodes and certain bit strings, and the number of the bit strings. We then show the algorithms of ranking and unranking for the bit strings. As one of application problem, algorithms for drawing of all binary trees with n nodes are discussed.},
 pages = {57--64},
 title = {2分木の符号化とその応用},
 volume = {48},
 year = {1993},
 yomi = {シミズ, ミチオ}
}