Skip to content
Try on iPad

Tree-traversal: AQA A‑Level Computer Science questions

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

Find questions561
Calculations

561 questions

  1. Q06.2

    June 2024 · Paper 1

    7 marks4.3.2 Tree-traversal
    The whole paper ↗
    June 2024 Paper 1, question 06.2: Complete the unshaded cells in Table 1 to show the result of tracing the algorithm shown in Figure 5 using the arrays in Figure 4. Table 1 Temp Done Pos [0] [1]

  2. Q06.3

    June 2024 · Paper 1

    2 marks4.3.2 Tree-traversal
    The whole paper ↗
    June 2024 Paper 1, question 06.3: The array Temp needs to be able to store three values when used with the binary tree shown in Figure 3, on page 6. For some binary trees with only five nodes, t

  3. Q06.5

    June 2024 · Paper 1

    1 mark4.3.2 Tree-traversal
    The whole paper ↗
    June 2024 Paper 1, question 06.5: Describe the changes that need to be made to the algorithm shown in Figure 5 so that the order that the data values are output in is reversed. In your answer, y

  4. Q02.2

    November 2021 · Paper 1

    2 marks4.3.2 Tree-traversal
    The whole paper ↗
    November 2021 Paper 1, question 02.2: The output of a post-order traversal algorithm used to print the data item at each node in the binary tree shown in Figure 1 would be E, H, I, Y, Q, B, C. State

  5. Q02.3

    November 2021 · Paper 1

    7 marks4.3.2 Tree-traversal4.2.3 Stacks
    The whole paper ↗
    November 2021 Paper 1, question 02.3: Complete the unshaded cells in Table 2 to show the result of the subroutine call Traversal(0) Table 2 Stack Current Pos [0] [1] [2] [3] Output Copy the contents
All 5 questions on Tree-traversal, as a list
  1. June 2024, Paper 1, Q06.2 (7 marks): Complete the unshaded cells in Table 1 to show the result of tracing the algorithm shown in Figure 5 using the arrays in Figure 4. Table 1 Temp Done Pos [0] [1]
  2. June 2024, Paper 1, Q06.3 (2 marks): The array Temp needs to be able to store three values when used with the binary tree shown in Figure 3, on page 6. For some binary trees with only five nodes, t
  3. June 2024, Paper 1, Q06.5 (1 mark): Describe the changes that need to be made to the algorithm shown in Figure 5 so that the order that the data values are output in is reversed. In your answer, y
  4. November 2021, Paper 1, Q02.2 (2 marks): The output of a post-order traversal algorithm used to print the data item at each node in the binary tree shown in Figure 1 would be E, H, I, Y, Q, B, C. State
  5. November 2021, Paper 1, Q02.3 (7 marks): Complete the unshaded cells in Table 2 to show the result of the subroutine call Traversal(0) Table 2 Stack Current Pos [0] [1] [2] [3] Output Copy the contents

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.