Question 9822 – Data-Structures
January 9, 2024Question 11062 – Network-Layer
January 9, 2024Question 9847 – Data-Structures
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 tree?
Correct Answer: D
Question 29 Explanation:
In full Binary tree LASTIN = LASTPRE.
But in case of complete binary last level need not to be full in that case LASTPRE is not equal to LASTIN.
But in case of complete binary last level need not to be full in that case LASTPRE is not equal to LASTIN.
LASTIN = LASTPOST
LASTIN = LASTPRE
LASTPRE = LASTPOST
None of the above
Subscribe
Login
0 Comments