Algorithm to store complete binary tree into an array
<p>I am learning data structure right now, from book I know that for a complete binary tree, we could store it in an array. But I cannot come up with an algorithm with it, nor could I transform an array into a complete binary tree. Can anyone help me with this in C? 
I think for a question like this could be solved in recursion, just like traversal in binary tree, but I cannot do it, nor could I solve it in non-recursion method.</p>