Computer Science · Data Structures
Select the structural limitation that exists in Tree Data Structures which is NOT present in Graphs:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Tree data structures can only represent hierarchical relationships (e.g., parent-child), whereas graphs can represent arbitrary, non-hierarchical relationships.✓
- 2Trees have nodes and edges, whereas graphs do not consist of nodes and edges.
- 3Tree data structures can store numeric data only, whereas graphs can store any data type.
- 4Searching for a node value is impossible in tree data structures, but possible in graphs.
Correct answer
Tree data structures can only represent hierarchical relationships (e.g., parent-child), whereas graphs can represent arbitrary, non-hierarchical relationships.
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