Question

Level order traversal in binary tree requires which data structure

Answer 1

Answer:

Double Linked List

A level-order traversal in a binary tree requires which

AVL/RBT is implemented using Double Linked List.

✌✌✌✌✌✌✌✌✌✌✌✌✌✌✌✌

Answer 2

Level order traversal in the binary tree requires a queue data structure.

• The non-primitive linear data structure which occurs dynamically is termed a queue.
• The different operations are executed in this data structure by following a certain sequence.
• The policy of the First In First Out(FIFO) order is followed in a queue.
• We can perform different operations like dequeue (deletion of items) and enqueue (insertion of items).

• Some other types of a queue are linear queue, priority queue, circular queue.