Back to the full dot-point answer
EnglandComputer ScienceQuick questions
Component 1: Programming and System Development
Quick questions on Binary trees, graphs and hashing - Eduqas A-Level Computer Science Component 1
3short Q&A pairs drawn directly from our worked dot-point answer. For full context and worked exam questions, read the parent dot-point page.
What is q1?Show answer
State the output order of an in-order traversal of a binary search tree. [1 mark]
What is q2?Show answer
Give one situation where an adjacency list is preferable to an adjacency matrix. [1 mark]
What is q3?Show answer
Describe what a collision is in a hash table and name one way to handle it. [2 marks]
Have a question we have not covered?
This dot-point answer is short enough that we have not extracted many short questions yet. Read the full dot-point answer or ask Mo, our study assistant, in the chat for follow ups.