title: Get Breadth First (Level) Order Without Constructing Red-Black Tree
body: <p>I have an ordered array of length <code>n</code> containing consecutive integer elements <code>1</code> to <code>n</code>. After constructing the red-black tree for this array, I can traverse this tree in level order using a standard breadth first search approach.</p>
  <p>My question is, given any <code>n &lt;= 100000000</code> (corresponding to an ordered array with consecutive integer elements from <code>1</code> to <code>n</code>), is it possible to bypass the construction of the tree and directly return the level order?</p>