Skip to content
Try on iPad

Trees: AQA A‑Level Computer Science questions

Every AQA A-Level Computer Science exam question on 4.2.5 Trees, 2020–2025, with its mark scheme and examiner’s report.

Find questions561
Calculations

561 questions

  1. Q03.2

    June 2025 · Paper 1

    2 marks4.2.5 Trees
    The whole paper ↗
    June 2025 Paper 1, question 03.2: State both the reasons why the graph in Figure 1 is not a tree. [2 marks]

  2. Q06.1

    June 2024 · Paper 1

    2 marks4.2.5 Trees
    The whole paper ↗
    June 2024 Paper 1, question 06.1: The graph in Figure 3 is a binary tree. A binary tree is a rooted tree where each node has at most two child nodes. There are three properties that a graph need

  3. Q03.1

    June 2023 · Paper 1

    2 marks4.2.5 Trees
    The whole paper ↗
    June 2023 Paper 1, question 03.1: State two characteristics that make a tree a binary tree. [2 marks]

  4. Q04.8

    June 2022 · Paper 1

    1 mark4.2.5 Trees
    The whole paper ↗
    June 2022 Paper 1, question 04.8: If the graph represented by ConnectedNodes is undirected, what can you determine about the graph when a value of True is returned by subroutine E? [1 mark]

  5. Q02.1

    November 2021 · Paper 1

    2 marks4.2.5 Trees
    The whole paper ↗
    November 2021 Paper 1, question 02.1: Define the term binary tree. [2 marks]
All 5 questions on Trees, as a list
  1. June 2025, Paper 1, Q03.2 (2 marks): State both the reasons why the graph in Figure 1 is not a tree. [2 marks]
  2. June 2024, Paper 1, Q06.1 (2 marks): The graph in Figure 3 is a binary tree. A binary tree is a rooted tree where each node has at most two child nodes. There are three properties that a graph need
  3. June 2023, Paper 1, Q03.1 (2 marks): State two characteristics that make a tree a binary tree. [2 marks]
  4. June 2022, Paper 1, Q04.8 (1 mark): If the graph represented by ConnectedNodes is undirected, what can you determine about the graph when a value of True is returned by subroutine E? [1 mark]
  5. November 2021, Paper 1, Q02.1 (2 marks): Define the term binary tree. [2 marks]

Questions, mark schemes and examiner’s reports are © AQA, from their published past papers. Plumi isn’t affiliated with any exam board. Want whole papers? Full past papers.

Rather write your answers by hand on iPad? Plumi marks them against the same mark schemes.