What are Splay tree, Red-black tree, AVL tree, B-tree and T-tree?
I’m looking for good implementations.
What are Splay tree, Red-black tree, AVL tree, B-tree and T-tree? I’m looking for
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
What are Splay tree, Red-black tree, AVL tree, B-tree and T-tree?
I’m looking for good implementations.
These are all data structures used for quickly searching binary data. Many are used by different data management systems.
They differ in their approach for storage of data. I’d recommend reading up on each.
Splay: http://en.wikipedia.org/wiki/Splay_tree
Red-Black: http://en.wikipedia.org/wiki/Red-black_tree
AVL: http://en.wikipedia.org/wiki/Avl_tree
B-Tree: http://en.wikipedia.org/wiki/B-Tree
T-Tree: http://en.wikipedia.org/wiki/T-tree