Topic study hub
Trees
Official AQA 7517 section 4.2.5.
0
Objectives
5
Flashcards
7
Questions
36 min
Study time
AqaA LevelComputer ScienceFundamentals of data structures
Choose a revision tool
Start revising Trees
Syllabus checklist
What you need to know
0 objective pages available
Trees (including binary trees)1 objectives
- Trees (including binary trees): Know that a tree is a connected, undirected graph with no cycles. Note that a tree does not have to have a root. Know that a rooted tree is a tree in which one vertex has been designated as the root. A rooted tree has parent-child relationships between nodes. The root is the only node with no parent and all other nodes are descendants of the root. Know that a binary tree is a rooted tree in which each node has at most two children. A common application of a binary tree is as a binary search tree. Be familiar with typical uses for rooted trees.
Key terms
Rooted treeBinary tree
Exam tips
- Watch the word 'at most': When describing a binary tree, write that each node has at most two children, not exactly two.
Common mistakes
- Assuming every tree has a root: A tree does not have to have a root. A rooted tree is a tree with one designated root vertex.
Practice preview
Continue by objective
Objectives are grouped by subtopic so students can jump straight to the exact skill they want to revise.
Related topics