Vidyalelo
Data Structure · Q237

Binary Search Trees(B Tree)

Programming · Data Structure · question 237

Q237

A binary search tree contains values 7, 8, 13, 26, 35, 40, 70, 75. Which one of the following is a valid post-order sequence of the tree provided the pre-order sequence as 35, 13, 7, 8, 26, 70, 40 and 75?

A.
7, 8, 26, 13, 75, 40, 70, 35
B.
26, 13, 7, 8, 70, 75, 40, 35
C.
7, 8, 13, 26, 35, 40, 70, 75
D.
8, 7, 26, 13, 40, 75, 70, 35
Answer

Answer: Option D

Solution

Answer: Option D
No explanation is given for this question Let's Discuss on Board