|
|
|||||||||
|
|||||||||
| |||||||||
|
|
|
| |||||||||
![]() |
|
|
«
Previous Thread
|
Next Thread
»
|
Thread Tools | Search this Thread | Rate Thread | Display Modes |
|
#1
|
|||
|
|||
|
2-3-4 tree
Hello all:
Does every node of the 2-3-4 tree just has at most 4 childs and 3 keys? rgds stewang |
|
#2
|
|||
|
|||
|
CLRS
Accoring to CLRS, Intro to Algorithms. A 2-3-4 tree is a b-tree with t=2 where:
1. Every node can contain at most 2t-1 keys. Therefore, an internal node can have at most 2t children . There are many other properties.. but this one answers your question. |
|
#3
|
|||
|
|||
|
Thanks for your response. I got it.
rgds steawang |
![]() |
| Viewing: Dev Shed Forums > Programming Languages - More > Software Design > 2-3-4 tree |
| Thread Tools | Search this Thread |
| Display Modes | Rate This Thread |
|
|
|
|