2-3 tree implementation from sorted array in O(n)-time

[Saeven]

Hello,

I've a quick question - anyone have an idea on what an efficient manner of building a 2-3 tree from a sorted array A[1..n] in O(n) time could be?

Thanks!
Alexandre