Computer Science · Data Structures
What will be the post-order traversal of a binary tree T, if its pre-order and in-order traversals are given by ABCDEF and BADCFE respectively?
- 1BDFECA✓
- 2BCFDEA
- 3BFDECA
- 4BEFDCA
Correct answer
BDFECA
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!
Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Want more practice questions on Data Structures?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Data Structures