Let LASTPOST, LASTIN and LASTPRE denote the last vertex visited in a postorder, inorder and preorder traversal, respectively, of a complete binary tree. Which of the following is always true?
(A) LASTIN = LASTPOST
(B) LASTIN = LASTPRE
(C) LASTPRE = LASTPOST
(D) None of the above
Answer: (D)
Explanation: See question 1 of https://www.geeksforgeeks.org/data-structures-and-algorithms-set-1/amp/
Quiz of this Question
GATE | GATE-CS-2000 | Question 39
Recommended Articles