Просмотр кода страницы Classification of Binary Trees

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

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

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

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

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

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

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

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

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

'''OGBST''' — [[Optimal generalized binary split tree|Optimal Generalized Binary Split Trees]].

==Литература==

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