Back to the full dot-point answer
EnglandComputer ScienceQuick questions
2.3 Algorithms
Quick questions on Graph traversal, tree traversal, Dijkstra's algorithm and A* - OCR A-Level Computer Science H446
2short 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 data structure used by a breadth-first traversal and by a depth-first traversal. [2 marks]
What is q2?Show answer
State which binary tree traversal outputs a binary search tree's values in ascending order. [1 mark]
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.