Download Question Paper Here
Will update Answer Key by end of day
1
|
11
|
A
|
21
|
C
|
31
|
D
|
41
|
B
|
|
2
|
12
|
C
|
22
|
C
|
32
|
B
|
42
|
D
|
|
3
|
13
|
C
|
23
|
33
|
B
|
43
|
B
|
||
4
|
14
|
A
|
24
|
34
|
D
|
44
|
D
|
||
5
|
15
|
D
|
25
|
A
|
35
|
C
|
45
|
C
|
|
6
|
B
|
16
|
C
|
26
|
A
|
36
|
D
|
46
|
D
|
7
|
17
|
A
|
27
|
D
|
37
|
A
|
47
|
||
8
|
A
|
18
|
C
|
28
|
B
|
38
|
C
|
48
|
B
|
9
|
19
|
C
|
29
|
39
|
B
|
49
|
|||
10
|
C
|
20
|
B
|
30
|
D
|
40
|
A
|
50
|
A
|
Explanation:
14-A
ReplyDelete18-C
41-B
Thanks VIRK
Delete1--D, 2---D, 3---B, 8---A, 10---C
ReplyDelete11-A, 12---C, 15---D, 19----C 21---C
Hi Ravi
DeleteThanks for the answers. hey tell me how to find out the preorder traversal from the given postorder?
Actually, i Construct a tree based on given post order, from the tree i found preorder. i got ABDECF.
ReplyDeleteSince it has objective paper and only one answer. so i make my answer as: C;
We can construct more than one tree for a given post ordee traversal..
Deleteyes, you are right, i make the tree as per options; since it is objective question.
ReplyDeleteLet me try the same.. Thanks ravi
Delete20----B, 22 ----C, 32----B
ReplyDeleteDone..
Delete13:C 17:C
ReplyDelete16-C rajiv mall Software engineering software Mainrtanance
ReplyDelete