Binary search tree: различия между версиями
Перейти к навигации
Перейти к поиску
Glk (обсуждение | вклад) (Новая страница: «'''Binary search tree''' --- бинарное дерево поиска. '''Binary search trees''' (BT) are a special class of GBST (''generalized binary split tre…») |
KVN (обсуждение | вклад) Нет описания правки |
||
| Строка 1: | Строка 1: | ||
'''Binary search tree''' | '''Binary search tree''' — ''[[бинарное дерево поиска]].'' | ||
'''Binary search trees''' (BT) are a special class of GBST (''generalized binary split trees'') with equal key and split values in all nodes. | '''Binary search trees''' (BT) are a special class of GBST (''[[generalized binary split tree|generalized binary split trees]]'') with equal key and [[split tree|split]] values in all [[node|nodes]]. | ||
Note that the BST's and BT's do not contain each other. | Note that the BST's and BT's do not contain each other. | ||
The intersection of BT's and BST's is the set of ''frequency-ordered binary search trees (FOBT's)''. | The intersection of BT's and BST's is the set of ''[[frequency-ordered binary search tree|frequency-ordered binary search trees]] (FOBT's)''. | ||
==Литература== | |||
* Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009. | |||
Текущая версия от 16:31, 23 октября 2018
Binary search tree — бинарное дерево поиска.
Binary search trees (BT) are a special class of GBST (generalized binary split trees) with equal key and split values in all nodes.
Note that the BST's and BT's do not contain each other. The intersection of BT's and BST's is the set of frequency-ordered binary search trees (FOBT's).
Литература
- Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.