September 6th, 2003, 02:33 AM
Does every node of the 2-3-4 tree just has at most 4 childs and 3 keys?
September 6th, 2003, 06:02 PM
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.
September 6th, 2003, 06:57 PM
Thanks for your response. I got it.