Brother tree

Материал из WEGA
Версия от 16:31, 23 октября 2018; KVN (обсуждение | вклад)
(разн.) ← Предыдущая версия | Текущая версия (разн.) | Следующая версия → (разн.)

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.