|
|
|
|
|
|
by skj
3856 days ago
|
|
|
I believe your and abcdabcd987's use of the term BST is not exactly what is commonly used. A BST refers to both the data structure and the algorithm used to manage it. An RB tree is a different concept. An RB tree is a binary tree, certainly, since the term "binary tree" implies no algorithms, but it is not a "binary search tree" in its specific denotation. |
|
|
> There are many types of binary search trees. AVL trees and red-black trees are both forms of self-balancing binary search trees.