# Building a Red Black tree out of a sorted array [closed]

If I have a sorted array of size $n$, can I build a Red Black tree out of it in $O(n)$ time in a different algorithm rather than splitting the tree in half every time or the straightforward way that was mentioned in one of the answers?

• @Trinarics And when the next answer comes along, will you again modify your question to ask for something else? – FrankW Jun 2 '14 at 13:25
• @FrankW no because that answer was what I have heard in class and I forgot to mention that I am looking for something different than it. – HaloKiller Jun 2 '14 at 13:27