Computer Science, asked by amithmanoj321, 1 month ago

65. For the following post-order traversal of a tree, indicate the root node. 6, 5, 2, 11, 7, 4, 9,
5,2
Α. 7
B. 2
C.5
D. 4

Answers

Answered by ayush8592
0

Answer:

This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Preorder Traversal”.

1. For the tree below, write the pre-order traversal.

data-structure-questions-answers-preorder-traversal-q1

a) 2, 7, 2, 6, 5, 11, 5, 9, 4

b) 2, 7, 5, 2, 6, 9, 5, 11, 4

c) 2, 5, 11, 6, 7, 4, 9, 5, 2

d) 2, 7, 5, 6, 11, 2, 5, 4, 9

Explanation:

Pre order traversal follows NLR(

Similar questions