@Arjun sir,In answer you mentioned that :-
LASTPRE will be from the second last level in case the complete binary tree is not full. So, choice (D).
LastIn should be from second lastindex in case last level is completely filled.LASTPRE will always be from last level.because if we are at second last level we process ROOT and then goto last level in pre order.Please check once?