Different trees

What are "Splay trees”, “Red-black trees”, AVL Tree, B-Tree and T-tree?

looking for good implementations.

Thanks

From stackoverflow

• The Tree Data Structure article on Wikipedia would be a good starting point for anyone wanting to learn about different tree structures. I believe that all of the referenced structures have links on the main Tree Data Structure entry.

  For implementations I would recommend looking at Cormen's Introduction to Algorithms text, also referenced at wikipedia. If you want concrete implementations, you'll need to specify your desired language.

  http://en.wikipedia.org/wiki/Tree_data_structure

• 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

• Besides the online resources I would also recommend you to get a real book about algorithms. I would strongly recommend Sedgewick:

  • Algorithms in C++
  • Algorithms in Java

  These are great books that will teach various algorithms (trees, search, graphs, etc.).