Let LASTPOST, LASTIN, and LASTPRE denote the last vertex visited in postorder,…

GATE · 2000 · CS · Question 2 subparts

Let LASTPOST, LASTIN, and LASTPRE denote the last vertex visited in 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

Attempted by 284 students.

Show answer

Correct answer: D

The worked solution is available to enrolled students.

Video solution available to enrolled students.

Explore the full course: Iocl Engineers Officers Grade A Paper 2