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.

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.