Computer Sciences > Gate 2020 > Binary Search Tree
The preorder traversal of a binary search tree is 15, 10, 12, 11, 20, 18, 16, 19. Which one of the following is the postorder traversal of the tree ?
A
10, 11, 12, 15, 16, 18, 19, 20
B
11, 12, 10, 16, 19, 18, 20, 15
C
20, 19, 18, 16, 15, 12, 11, 10
D
19, 16, 18, 20, 11, 12, 10, 15

Correct : b

Similar Questions

While inserting the elements 71, 65, 84, 69, 67, 83 in an empty binary search tree (BST) in the sequence shown, the element in the lowest level is
#34 MCQ
What are the worst-case complexities of insertion and deletion of a key in a binary search tree?
#69 MCQ
Let T be a binary search tree with 15 nodes. The minimum and maximum possible heights of T are: Note: The height of a tree with a single node is 0.
#211 MCQ

Related Topics

binary search tree preorder traversal binary search tree postorder traversal GATE CS 2020 Q24 computer science gate binary tree traversal binary search tree questions GATE 2020 Computer Science binary tree postorder

Unique Visitor Count

Total Unique Visitors

Loading......

Question Options

Contributed by: