Open In App
Related Articles

GATE | GATE-CS-2000 | Question 39

Improve
Improve
Improve
Like Article
Like
Save Article
Save
Report issue
Report
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/

Quiz of this Question

Last Updated : 28 Jun, 2021
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads