Classification of Binary Trees: различия между версиями

Материал из WEGA
Перейти к навигации Перейти к поиску
(Новая страница: «'''Classification of Binary Trees''' --- классификация бинарных деревьев. The following classes of ''binary trees''are considered: …»)
 
Нет описания правки
 
Строка 1: Строка 1:
'''Classification of  Binary  Trees''' --- классификация бинарных
'''Classification of  Binary  Trees''' — ''[[классификация бинарных деревьев]].''
деревьев.  


The following classes of ''binary trees''are considered:
The following classes of ''[[binary tree|binary trees]]'' are considered:


'''BT''' --- Binary Search Trees;
'''BT''' — [[Binary search tree|Binary Search Trees]];


'''BST''' --- Binary Split Trees;
'''BST''' — [[Binary split tree|Binary Split Trees]];


'''FOBT''' --- Frequency-Ordered Binary Search Trees;
'''FOBT''' — [[Frequency-ordered binary search tree|Frequency-Ordered Binary Search Trees]];


'''GBST''' --- Generalized Binary Split Trees;
'''GBST''' — [[Generalized binary split tree|Generalized Binary Split Trees]];


'''MST''' --- Median Split Trees;
'''MST''' — [[Median split tree|Median Split Trees]];


'''OBST''' --- Optimal Binary Split Trees;
'''OBST''' — [[Optimal binary split tree|Optimal Binary Split Trees]];


'''OBT''' --- Optimal Binary Search Trees;
'''OBT''' — [[Optimal binary search tree|Optimal Binary Search Trees]];


'''OGBST''' --- Optimal Generalized Binary Split Trees.
'''OGBST''' — [[Optimal generalized binary split tree|Optimal Generalized Binary Split Trees]].
 
==Литература==
 
* Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.

Текущая версия от 10:44, 24 октября 2018

Classification of Binary Trees — классификация бинарных деревьев.

The following classes of binary trees are considered:

BT — Binary Search Trees;

BST — Binary Split Trees;

FOBT — Frequency-Ordered Binary Search Trees;

GBST — Generalized Binary Split Trees;

MST — Median Split Trees;

OBST — Optimal Binary Split Trees;

OBT — Optimal Binary Search Trees;

OGBST — Optimal Generalized Binary Split Trees.

Литература

  • Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.
Источник — http://pco.iis.nsk.su/wega/index.php?title=Classification_of_Binary_Trees&oldid=13385