Computer Science · Binary Trees
Let T be a rooted binary tree whose vertices are labelled with symbols a, b, c, d, e, f, g, h, i, j, k. Suppose the in-order and post-order traversals of T produce the following sequences: In-order: a, b, c, d, e, f, g, h, i, j, k Post-order: a, c, b, e, f, h, j, k, i, g, d Which set of symbols represents all the leaf nodes of tree T?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1b, c, h, i, j
- 2c, b, h, i, j
- 3a, e, h, i, j
- 4a, c, e, h, j✓
Correct answer
a, c, e, h, j
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Binary Trees MCQs →Want more practice questions on Binary Trees?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Binary Trees