|
|||||||||
|
|||||||||
| |||||||||
|
|||||||||
|
|||||||||
| |||||||||
|
|
|
| |||||||||
 |
|
|
«
Previous Thread
|
Next Thread
»
|
Thread Tools | Search this Thread | Rate Thread | Display Modes |
Dev Shed Forums Sponsor:
|
|
|
|
#1
September 21st, 2005, 07:30 PM
|
|||
|
|||
|
2-3-4 trees
Hi,
Is there a formula or rule of thumb in order to count the number of possible trees that are formed after inserting n elements (starting from an empty tree?). Thanks
|
|
| Viewing: Dev Shed Forums > Programming Languages - More > Software Design > 2-3-4 trees |
| Thread Tools | Search this Thread |
| Display Modes | Rate This Thread |
|
|
 |
|
|
Del.icio.us
Digg
Google
Spurl
Blink
Furl
Simpy
Y! MyWeb
Linear Mode
