A BST has root 8, left 3, right 10. What is the in-order traversal?
- Left subtree first: 3.
- Then root: 8.
- Then right: 10.
Answer 3, 8, 10
A-level Computer Science revision · Data structures and algorithms
Tree traversals visit every node. Pre-order: root, left, right. In-order: left, root, right (gives sorted order for a BST). Post-order: left, right, root. Depth-first search goes deep before backtracking (using a stack); breadth-first visits level by level (using a queue).
Watch out In-order traversal only gives sorted output for a binary search tree.
A BST has root 8, left 3, right 10. What is the in-order traversal?
Answer 3, 8, 10
Which traversal visits the root first?
Which data structure does breadth-first search use?
Root A has left child B and right child C; B has left child D. What is the post-order traversal?
A-level Computer Science Pro, OCR H446
£119 once
Price rises to £199 on 1 January. Save £80 by joining before then.
At least 12 months of access
No VAT is charged.