Learning objective

Binary tree search: Be able to trace and analyse the time complexity of the binary tree search algorithm. Time complexity is O(log n).

Read the explanation, check the common trap, then practise with flashcards and questions.

Start flashcards Try practice questions Topic hub

At a glance

Flashcards

Questions

Topic

Searching algorithms

Subtopic

Binary tree search

Aqa A Level Computer ScienceFundamentals of algorithms

Study support

Understand this objective

Quick explanation

Binary tree search: Be able to trace and analyse the time complexity of the binary tree search algorithm. Time complexity is O(log n)

This point belongs to Searching algorithms, especially Binary tree search.
You need to be able to binary tree search: Be able to trace and analyse the time complexity of the binary tree search algorithm. Time complexity is O(log n).
Use the linked flashcards and practice questions to check recall, then practise applying the idea in an exam-style answer.

Why it matters

This objective helps connect Binary tree search to exam-style questions, flashcards, and revision notes for Searching algorithms.

Quick student answer

A binary tree search starts at the root node with value 50. The left child is 30 and the right child is 70. The target value is 30. Which node is examined first, and what happens next?

Direct answer

B. 50 is examined first, then the search moves left

Key terms

Root node: The starting node at the top of a binary tree, examined first during a binary tree search.
Time complexity: A description of how the amount of work required by an algorithm changes as the number of values, n, changes.

Common trap

Starting at the wrong node: Always record and compare the root value first, then follow the branch selected by the comparison.

Try this as a practice card

4 linked

Question 1 of 4

Choose an answer, get feedback, then move sideways through the set.

0 of 4 attempted

Question 1

A binary tree search starts at the root node with value 50. The left child is 30 and the right child is 70. The target value is 30. Which node is examined first, and what happens next?

Flashcard prompts

Flip through the key recall cards

4 cards

Flashcard 1 of 4

Press Space to flip, arrows to move

Revision tools

Choose how to practise

Back to topic hub

Flashcards0 linked cards

No objective-specific flashcards are cached for this page. Use the topic hub to revise the surrounding flashcards without triggering a frozen-subject DB fallback.Open topic hub

Practice Questions0 linked questions

No objective-specific practice questions are cached for this page. Use the topic question bank to practise nearby curriculum questions without weakening the egress guard.Open topic questions

Binary tree search: Be able to trace and analyse the time complexity of the binary tree search algorithm. Time complexity is O(log n).

Understand this objective

Binary tree search: Be able to trace and analyse the time complexity of the binary tree search algorithm. Time complexity is O(log n)

A binary tree search starts at the root node with value 50. The left child is 30 and the right child is 70. The target value is 30. Which node is examined first, and what happens next?

Try this as a practice card

A binary tree search starts at the root node with value 50. The left child is 30 and the right child is 70. The target value is 30. Which node is examined first, and what happens next?

Flip through the key recall cards

Choose how to practise

Related learning objectives