ZIMSEC A-Level Computer Science
6.6Binary trees and array operations
Binary trees and array operations in ZIMSEC A-Level Computer Science: what the syllabus expects you to know, the learning objectives and how to practise.
Subtopic23 practice questions1 lesson
Overview
Form 6 (competency matrix 8.11): sorting, deletion, insertion and searching in binary trees and arrays.
Learning objectives
What the syllabus expects you to be able to do.
- 6.6.1Perform insertion, deletion, searching and sorting operations on binary trees and arrays.
Lessons
- Full access
Binary trees and their algorithms
65 min
Join to read every lesson, or see what Full access includes.
Sample question
A sample question on this topic. Answer it, check it, then read the worked answer.
Turn Binary trees and array operations into a strength.
Practise with instant marking, see your mastery grow and get a study plan built around your exam date.