Computer Science · Data Structures
Which of the following describes a structural limitation present in standard Tree data structures that is not present in Graphs?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Trees can only represent strictly hierarchical relationships (such as parent-child), whereas Graphs can represent arbitrary relationships between nodes.✓
- 2Trees contain visible nodes and edges, whereas Graphs do not contain nodes or edges.
- 3Trees can store only numeric data, whereas Graphs can store any data type.
- 4Searching for a value is impossible in Trees, but possible in Graphs.
Correct answer
Trees can only represent strictly hierarchical relationships (such as parent-child), whereas Graphs can represent arbitrary relationships between nodes.
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