GATE CS 2020 (Forenoon) — Question 15

Data StructuresBinary Search Trees (BSTs) & Binary HeapsMCQ1 mark · −1/3 if wrongEasy

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?
  1. A
    10, 11, 12, 15, 16, 18, 19, 20
  2. B
    11, 12, 10, 16, 19, 18, 20, 15
  3. C
    20, 19, 18, 16, 15, 12, 11, 10
  4. D
    19, 16, 18, 20, 11, 12, 10, 15
Practise the full 2020-FN paper
Challenge a friend: WhatsApp Telegram
Recommended book · affiliate linkIntroduction to Algorithms (CLRS)The standard reference behind most GATE algorithm questions.
Practise more on Binary Search Trees (BSTs) & Binary HeapsTimed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group