The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+1 vote
72 views
A binary search tree contains the numbers 1, 2, 3, 4, 5, 6, 7, 8. The tree is traversed in pre-order and the values of in each node printed out the sequence of values obtained is 5,3,1,2,4,6,8,7. If the tree is traversed in post order, the sequence obtained would be

A) 8 7 6 5 4 3 2 1

B) 1 2 3 4 8 7 6 5

C) 2 1 4 3 6 7 8 5

D) 2 1 4 3 7 8 6 5
closed as a duplicate of: GATE2005-IT-55
in DS by Boss (11k points)
closed by | 72 views

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,288 questions
55,719 answers
192,112 comments
90,123 users