| 作成者 |
|
|
|
| 本文言語 |
|
| 出版者 |
|
|
|
| 発行日 |
|
| 収録物名 |
|
| 巻 |
|
| 号 |
|
| 開始ページ |
|
| 終了ページ |
|
| 出版タイプ |
|
| アクセス権 |
|
| JaLC DOI |
|
| 関連情報 |
|
| 概要 |
Properties are well-researched not only on the whole set of binary trees but also on some subsets of binary trees. In this paper, we discuss properties on a subset of binary trees - leftchain trees. T...he concept of leftchain trees is presented with the background of certain applications and a necessary and sufficient condition is found for leftchain trees. A relation is given on leftchain trees, it is proved that the relation is a boolean lattice on leftchain trees, and rank and unrank functions for leftchain trees are obtained based on the result above. It is pointed out that properties on leftchain trees can be grafted on rightchain trees easily.続きを見る
|
Mendeley出力
