Data Structure: Tree

A radix tree, Patricia trie/tree, or crit bit tree is a specialized set data 

 

structure based on the trie that is used to store a set of strings.

(http://en.wikipedia.org/wiki/Radix_tree)

 

A red-black tree is a type of self-balancing binary search tree, a data 

 

structure used in computing science, typically used to implement associative 

 

arrays.

(http://en.wikipedia.org/wiki/Red-black_tree)

 

 

A B+ tree (BplusTree) is a type of tree which represents sorted data in a way 

 

that allows for efficient insertion, retrieval and removal of records, each 

 

of which is identified by a key.

(http://en.wikipedia.org/wiki/B%2B_tree)

 

A B*-tree is a tree data structure, a variety of B-tree used in the HFS and 

 

Reiser4 file systems, which requires non-root nodes to be at least 2/3 full 

 

instead of 1/2.

(http://en.wikipedia.org/wiki/B*-tree)

 

A B-tree is a tree data structure that keeps data sorted and allows searches, 

 

insertions, deletions, and sequential access in logarithmic amortized time.

(http://en.wikipedia.org/wiki/B-tree)