Brother tree: различия между версиями

Материал из WEGA
Перейти к навигации Перейти к поиску
(Новая страница: «'''Brother tree''' --- братское дерево, HB-дерево. A '''brother tree''' is a rooted oriented tree each of whose internal nodes has either one o…»)
 
Нет описания правки
 
Строка 1: Строка 1:
'''Brother tree''' --- братское дерево, HB-дерево.  
'''Brother tree''' — ''[[братское дерево]], [[HB-Дерево|HB-дерево]].''


A '''brother tree''' is a rooted oriented tree each of whose internal nodes has
A '''brother tree''' is a [[rooted tree|rooted]] [[oriented tree]] each of whose internal [[node|nodes]] has
either one or two sons. Each unary node must have a binary brother.
either one or two [[son|sons]]. Each unary node must have a binary brother.
All external nodes are at the same ''depth''. The number of internal
All external nodes are at the same ''[[depth of a tree|depth]]''. The number of internal
binary nodes of a brother tree is called its size. Note that the
binary nodes of a brother tree is called its size. Note that the
number of external nodes of a brother tree is always by 1 greater than
number of external nodes of a brother tree is always by 1 greater than
its size.
its size.


Another name is '''HB-Tree'''.
Another name is '''[[HB-Tree]]'''.
 
==Литература==
 
* Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.

Текущая версия от 16:31, 23 октября 2018

Brother treeбратское дерево, HB-дерево.

A brother tree is a rooted oriented tree each of whose internal nodes has either one or two sons. Each unary node must have a binary brother. All external nodes are at the same depth. The number of internal binary nodes of a brother tree is called its size. Note that the number of external nodes of a brother tree is always by 1 greater than its size.

Another name is HB-Tree.

Литература

  • Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.