An interesting data structure with search time O(sqrt n)

Re:An interesting data structure with search time O(sqrt n) by skj on Tuesday December 01, 2015 @09:32AM (#10655557)

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.

[ Parent | on HN ]

Re:An interesting data structure with search time O(sqrt n) by Veedrac on Tuesday December 01, 2015 @12:05PM (#10656961)

https://en.wikipedia.org/wiki/Binary_search_tree#Types

> There are many types of binary search trees. AVL trees and red-black trees are both forms of self-balancing binary search trees.

[ Parent | on HN ]