Let LASTPOST, LASTIN, and LASTPRE denote the last vertex visited in postorder,…
PYQ GATE 2000
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 426 students.
Sign up free to check your answer
Sign up freeLoading lesson…

