<div>
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 &quot;connected&quot; to be interpreted as one node.. It all makes sence, but the book:<br />
<br />
Algorithms in C++<br />
<br />
by Robert Sedgewick (ISBN 0-201-51059-6) explains this topic far better than I ever will..<br />
<br />
Hope this helps!
</div>


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!

<div>
do you know of any place on the net i could find info on this?
</div>


do you know of any place on the net i could find info on this?

<div>
Nope.. Try a search for 2-3-4 trees, or red-black trees (which they are also called)...
</div>


Nope.. Try a search for 2-3-4 trees, or red-black trees (which they are also called)...

<div>
<div class="content wysiwyg-content">
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.
</div>
</div>


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.

2-3 Trees

C++ is an intermediate-level general-purpose programming language, not to be confused with C or C#. It was developed as a set of extensions to the C programming language to improve type-safety and add support for automatic resource management, object-orientation, generic programming, and exception handling, among other features.