Thread: 2-3-4 tree

    #1
  1. No Profile Picture
    Junior Member
    Devshed Newbie (0 - 499 posts)

    Join Date
    Aug 2003
    Posts
    24
    Rep Power
    0

    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. #2
  3. No Profile Picture
    Mid-level Member
    Devshed Newbie (0 - 499 posts)

    Join Date
    Aug 2003
    Posts
    44
    Rep Power
    11

    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.
  4. #3
  5. No Profile Picture
    Junior Member
    Devshed Newbie (0 - 499 posts)

    Join Date
    Aug 2003
    Posts
    24
    Rep Power
    0
    Thanks for your response. I got it.

    rgds
    steawang

IMN logo majestic logo threadwatch logo seochat tools logo