GATE CS 2017 (Afternoon) — Question 36

Data StructuresBinary Search Trees (BSTs) & Binary HeapsMCQ2 marks · −2/3 if wrongMedium

The pre-order traversal 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:
  1. A
    2, 6, 7, 8, 9, 10, 12, 15, 16, 17, 19, 20
  2. B
    2, 7, 6, 10, 9, 8, 15, 17, 20, 19, 16, 12
  3. C
    7, 2, 6, 8, 9, 10, 20, 17, 19, 15, 16, 12
  4. D
    7, 6, 2, 10, 9, 8, 15, 16, 17, 20, 19, 12
Practise the full 2017-AN 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