Answer is (D)
Whenever we insert an element in heap, it will be in last level from left to right. So, here we insert element $1$ and $7$ as children of node $5$. Then we perform heapify algorithm until we get the min/max heap. So, finally we get the heap whose level order traversal is $10,8,7,3,2,1,5$
Initial heap:
After insert of $1$
After insert of $7$