closed by
280 views
1 votes
1 votes
closed as a duplicate of: GATE IT 2005 | Question: 55
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 by

Related questions

0 votes
0 votes
0 answers
1
Sankaranarayanan P.N asked Oct 27, 2016
299 views
IN a binary tree, the number of internal nodes of degree one is 5 and the number of internal nodes of degree 2 is 10. The number of leaf nodes in the binary tree isA) 15B...
0 votes
0 votes
0 answers
2
Sankaranarayanan P.N asked Oct 27, 2016
318 views
The maximum number of edges in an acyclic undirected graph with n verticesA) n - 1B) nC) n +1D) 2n -1
0 votes
0 votes
0 answers
3
Sankaranarayanan P.N asked Oct 27, 2016
362 views
Let P be a singly linked list. Let Q be the pointer to an intermediate node X in the list. What is the worst case time complexity of the best known algorithm to delete no...