AQA 7517 4.3.4.3: Binary tree search
The free BugBot lesson that teach this point, a robot to try it on, and the past-paper questions that test it.
Lessons that teach it
- A4.6 Binary search trees Trees and graphs
Building, inserting and searching, O(log n) against O(n), trees stored in arrays, and deletion in outline.
Try it on a robot
The task from A4.6 Binary search trees, running here. Change the program and press Run.
The specification is AQA's own document; this page says which of our lessons teach point 4.3.4.3 and is not endorsed by the board.