Skip to content
free
K
1
2
practice
Home
Math
English
Science
Social Studies
Contact
Language
English
Español
Sign In
/
High School Electives
/
Computer Science
/
Trees
Grade Level
Computer Science
HSCS.155 Trees
0%
Skill Level
🔴 Hard
00:00
Progress to Next Level
25% to Medium
Easy
Medium
Hard
Mastery
100%
A program must store a tree in which each node may have any number of children and most nodes have few children. Which representation is usually most space-efficient and flexible?
A
Store every possible node in a full matrix of parent choices.
B
Reserve exactly ten child fields for every node.
C
Store only a left child and forbid all other children.
D
Store a list of children for each node.
Submit Answer