| 翻訳と辞書 |
(a,b)-tree
In computer science, an (a,b) tree is a kind of balanced search tree.
An (a,b)-tree has all of its leaves at the same depth, and all internal nodes except for the root have between and children, where and are integers such that . The root has, if it is not a leaf, between 2 and children.
== Definition ==
Let , be positive integers such that . Then a rooted tree is an (a,b)-tree when:
* Every inner node except the root has at least and at most children.
* The root has at most children.
* All paths from the root to the leaves are of the same length.
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「(a,b)-tree」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|