Which of the following tree traversal uses a queue data structure?
(A) Preorder
(B) Inorder
(C) Postorder
(D) Level order
Answer: (D)
Explanation: Level order traversal uses a queue data structure to visit the nodes level by level.
Quiz of this Question
Feeling lost in the world of random DSA topics, wasting time without progress? It’s time for a change! Join our DSA course, where we’ll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!
