i hav started started studying binary trees.i m stuck with one problem,which is as follows:-

1)create a binary tree(not a binary search tree) in C using elements from a array[25] such that for every index m , left child is the 2m index value in array and right child will be in 2m+1-th index

for example:- For a node A[3] the left child is the A[2*3] index element and right child is in A[(2*3) +1 ] th position. So left child of A[3] is A[6] and right is A[7].

and similarly for other nodes.

please help me solving the above problem as i thought a lot over it but could n't find a good solution.