In a binary tree, what does a level-order traversal use to keep track of nodes?

Practice Questions

1 question
Q1
In a binary tree, what does a level-order traversal use to keep track of nodes?
  1. Stack
  2. Queue
  3. Array
  4. Linked List

Questions & Step-by-step Solutions

1 item
Q
Q: In a binary tree, what does a level-order traversal use to keep track of nodes?
Solution: Level-order traversal uses a queue to keep track of nodes at each level as it processes them.
Steps: 0

Related Questions

Soulshift Feedback ×

On a scale of 0–10, how likely are you to recommend The Soulshift Academy?

Not likely Very likely