Computer Science · Data Structures and Algorithms
The preorder traversal of a binary search tree is given as: 38, 14, 8, 23, 18, 20, 56, 45, 82, 70. What is its postorder traversal?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 182, 70, 56, 45, 38, 23, 20, 18, 14, 8
- 28, 20, 18, 23, 14, 45, 70, 82, 56, 38✓
- 38, 18, 20, 23, 14, 45, 70, 82, 56, 38
- 423, 20, 18, 14, 8, 38, 45, 56, 70, 82
Correct answer
8, 20, 18, 23, 14, 45, 70, 82, 56, 38
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 Data Structures and Algorithms MCQs →Want more practice questions on Data Structures and Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Data Structures and Algorithms