Binary-Trees
January 9, 2024Network-Layer
January 9, 2024Data-Structures
|
Question 47
|
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?
|
LASTIN = LASTPOST
|
|
|
LASTIN = LASTPRE
|
|
|
LASTPRE = LASTPOST
|
|
|
None of the above
|
Question 47 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.
Correct Answer: D
Question 47 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.
Subscribe
Login
0 Comments