Computer Science · Data Structures - Trees
After inserting the elements 40, 20, 60, 10, 30, 50, 70 into an empty Binary Search Tree (BST), what will be the Inorder traversal of the resulting tree?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 170, 60, 50, 40, 30, 20, 10
- 240, 20, 10, 30, 60, 50, 70
- 310, 20, 30, 40, 50, 60, 70✓
- 440, 60, 70, 50, 20, 30, 10
Correct answer
10, 20, 30, 40, 50, 60, 70
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 - Trees MCQs →Want more practice questions on Data Structures - Trees?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Data Structures - Trees