2-3 Trees

I was readin in a book about trees and they mentioned this kind of trees called 2-3 trees. I would like to know what are them and where i can get some info on methods and implementations on it.
desperadoAsked:
Who is Participating?

[Webinar] Streamline your web hosting managementRegister Today

x
 
ntdragonConnect With a Mentor Commented:
it not then 2-3 tree it's a name of a tree like a binary tree it just a name

the idea of this tree is that in each place in the tree you have 3 data members except the leafs but this data is only indexs of the tree the data that you want to store in this tree is stored only in the leafs each leaf only
2 or 3 data members with data u want to store in the tree
the mean idea is that the lengh of tree
is log(n)
that means that all the operation like insert,delete,find are made in O(lon(n))

if you want to learn more about it you should take a book in ADT abstract data type

if you"ll be inteseted and u won't find any book about it send me an e-mail i"ll find for you some books in english
0
 
lar_jensCommented:
What you (most likely) are thinking about is 2-3-4 trees.. These are binary trees, but are organized in a special way so that up to 4 nodes is "connected" to be interpreted as one node.. It all makes sence, but the book:

Algorithms in C++

by Robert Sedgewick (ISBN 0-201-51059-6) explains this topic far better than I ever will..

Hope this helps!
0
 
desperadoAuthor Commented:
do you know of any place on the net i could find info on this?
0
 
lar_jensCommented:
Nope.. Try a search for 2-3-4 trees, or red-black trees (which they are also called)...
0
All Courses

From novice to tech pro — start learning today.