Computer Science · Data Structures
The following is the sequence of visiting nodes in a binary tree: In-order traversal: C, D, B, F, E, A, H, I, G Pre-order traversal: A, B, C, D, E, F, G, H, I Which node is the root node of this binary tree?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1C
- 2D
- 3A✓
- 4F
Correct answer
A
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 MCQs →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