The pre-order transversal of a binary search tree is given b

Please wait...
THANKU FOR BEING A PART OF OUR JOURNEY TO BRING "REVOLUTION IN EDUCATION"
We Genuinely APPRECIATE your PATIENCE

SKINS
ADS

Red
Pink
Purple
Deep Purple
Indigo
Blue
Light Blue
Cyan
Teal
Green
Light Green
Lime
Yellow
Amber
Orange
Deep Orange
Brown
Grey
Blue Grey
Black
White

Coming Soon

49

M: +2.00/-0.33

The pre-order transversal of a binary search tree is given by 12, 8, 6, 2, 7, 9, 10, 16, 15, 19, 17, 20. Then the post-order traversal of this tree is:

[GATE CS 2017 Set 2]

A 2,6,7,8,9,10,12,15,16,17,19,20

B 2,7,6,10,9,8,15,17,20,19,16,12

C 7,2,6,8,9,10,20,17,19,15,16,12

D 7,6,2,10,9,8,15,16,17,20,19,12