Iterative Formulas for Enumerating Binary Trees - Collections

＜departmental bulletin paper＞
Iterative Formulas for Enumerating Binary Trees

Creator	Creator Name Xiang, Limin Affiliation Affiliation Name Department of Computer Science and Communication Engineering,Kyushu University : Graduate Student
Creator	Creator Name Ushijima, Kazuo 牛島, 和夫ウシジマ, カズオ Affiliation Affiliation Name Department of Computer Science and Communication Engineering, Kyushu University 九州大学大学院システム情報科学研究院情報工学専攻
Language	English
Publisher	九州大学大学院システム情報科学研究科
Publisher	Graduate School of Information Science and Electrical Engineering
Date	1997-09-26
Source Title	Research reports on information science and electrical engineering of Kyushu University
Vol	2
Issue	2
First Page	179
Last Page	183
Publication Type	Version of Record
Access Rights	open access
JaLC DOI	https://doi.org/10.15017/1522388
Related DOI	https://portal.isee.kyushu-u.ac.jp/
Related URI	https://portal.isee.kyushu-u.ac.jp/
Relation	https://portal.isee.kyushu-u.ac.jp/
Abstract	Enumeration is an important aspect for combinatorial properties of binary trees. Traditional solutions for enumerating binary trees are expressed by algorithms and most of them are recursive. In this ...paper, we give our solutions by iterative formulas for enumerating binary trees. Iterative algorithms can be obtained easily based on the iterative formulas for enumerating binary trees, and the iterative algorithms can be guaranteed to be correct.show more

File	FileType	Size	Views	Description
p179	pdf	395 KB	298