Start learning →

A data structure whose nodes each have zero or more child nodes is a:

ATable
BToken
CTree
DTuple
Answer & Solution
Correct answer: C. Tree
1. Nodes form a hierarchy rather than a line. 2. Each node may have descendants. 3. That structure is a tree. _Source: OpenStax Introduction to Computer Science, Chapter 3, Data Structures and Algorithms._
Practise this question with Quill — Coding Interview Prep →

Keep practising Data Structures and Algorithms

Browse all Data Structures and Algorithms questions for Coding Interview Prep, or explore more Computer Science topics.

Start a Data Structures and Algorithms lesson →
Related questions