🎙 Free live masterclass · Sun, 29 Nov, 7:00 pm IST · Java Full Stack roadmap Register free →
Skills101
← Quiz: Tree Traversals: all 13 questions

Quiz: Tree Traversals · Question 3 of 13

What does this print? (code)

What does this print?

from collections import deque
tree = {1: [2, 3], 2: [4], 3: [5, 6], 4: [], 5: [], 6: []}
q, out = deque([1]), []
while q:
    n = q.popleft()
    out.append(n)
    q.extend(tree[n])
print(out)
  1. A.[1, 2, 4, 3, 5, 6]
  2. B.[1, 2, 3, 4, 5, 6]
  3. C.[4, 2, 5, 6, 3, 1]
  4. D.[1, 3, 6, 5, 2, 4]
Answer & explanation

Correct answer: [1, 2, 3, 4, 5, 6]

A queue gives breadth-first order: level by level, left to right.

Can you get the rest right without peeking?

Take the timed Quiz: Tree Traversals quiz free. Pass it to earn XP and count towards your certificate.

Start the quiz →