| 作成者 |
|
|
|
| 本文言語 |
|
| 出版者 |
|
|
|
| 発行日 |
|
| 収録物名 |
|
| 巻 |
|
| 号 |
|
| 開始ページ |
|
| 終了ページ |
|
| 出版タイプ |
|
| アクセス権 |
|
| JaLC DOI |
|
| 関連DOI |
|
| 関連URI |
|
| 関連情報 |
|
| 概要 |
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.続きを見る
|
Mendeley出力
